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