Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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