Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

(¬((q → p) ∨ F) ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)

⇒ logic.propositional.defimpl

(¬(¬q ∨ p ∨ F) ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)

⇒ logic.propositional.falsezeroor

(¬(¬q ∨ p) ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)