Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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