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