Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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