Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroand

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

⇒ logic.propositional.falsezeroor

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