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