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