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