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