Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defimpl

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