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