Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.truezeroand

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