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