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