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