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