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