Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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