Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.truezeroand

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