Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.falsezeroor

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