Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬(q → p) ↔ (((r ↔ s) ∨ ¬(¬T ∨ s)) ∧ ((r ↔ s) ∨ ¬s))

⇒ logic.propositional.nottrue

¬(q → p) ↔ (((r ↔ s) ∨ ¬(F ∨ s)) ∧ ((r ↔ s) ∨ ¬s))