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