Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpor

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