Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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