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