Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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