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