Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.falsezeroor

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