Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpor

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