Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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