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