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