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