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