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