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