Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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