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