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