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