Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬(¬q ∨ p) ↔ ((((r ∧ T) ∨ r) ↔ s) ∨ (¬s ∧ ¬s))

⇒ logic.propositional.truezeroand

¬(¬q ∨ p) ↔ (((r ∨ r) ↔ s) ∨ (¬s ∧ ¬s))