Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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