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