Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished¬(F ∨ (q → p) ∨ (q → (T ∧ p))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.defimpl¬(F ∨ ¬q ∨ p ∨ (q → (T ∧ p))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.falsezeroor¬(¬q ∨ p ∨ (q → (T ∧ p))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.truezeroand¬(¬q ∨ p ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.defimpl¬(¬q ∨ p ∨ ¬q ∨ p) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.idempor¬(¬q ∨ p) ↔ ((r ↔ s) ∨ ¬s)