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