Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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