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