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