Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished((T ∧ F) ∨ (T ∧ ¬(q → p))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.truezeroand((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.notnot((T ∧ F) ∨ (q ∧ ¬p)) ↔ ((r ↔ s) ∨ ¬s)