Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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