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