Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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