Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.defimpl

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