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