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