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