Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.falsezeroor

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