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