Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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