Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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