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