Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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