Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished¬(q → ((p ∧ T) ∨ (p ∧ T))) ↔ (((r ∧ T) ↔ s) ∨ ¬s)
⇒ logic.propositional.truezeroand¬(q → ((p ∧ T) ∨ (p ∧ T))) ↔ ((r ↔ s) ∨ ¬s)