Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ T))) ∧ (¬¬¬(q → p) ↔ (((r ∨ F) ↔ s) ∨ ¬s))
⇒ logic.propositional.truezeroand(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬¬¬(q → p) ↔ (((r ∨ F) ↔ s) ∨ ¬s))