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