Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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