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