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