Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
![](http://ideas.cs.uu.nl/images/external.png)
(T ∧ ¬(q → p)) ↔ (((r ↔ s) ∧ T) ∨ ¬(s ∧ s))
⇒ logic.propositional.truezeroand(T ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s))
⇒ logic.propositional.defequiv(T ∧ ¬(q → p)) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬(s ∧ s))