Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempor

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