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