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