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