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