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 ∧ T))
⇒ logic.propositional.truezeroand¬(q → p) ↔ ((r ↔ (F ∨ s)) ∨ (¬s ∧ T ∧ T))