Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempor

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