Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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