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