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