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