Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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