Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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