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