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