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