Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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