Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.falsezeroor

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