Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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