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