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