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