Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

¬(¬q ∨ p) ↔ (((r ∨ r) ↔ s) ∨ ¬s)