Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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