Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.truezeroand

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