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