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