Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.falsezeroor

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