Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.truezeroand

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