Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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