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