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