Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

((T ∧ ¬(q → p)) ↔ ((r ↔ (s ∧ s)) ∨ ¬s)) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))

⇒ logic.propositional.idempand

((T ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))