Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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