Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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