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