Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defimpl

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