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