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