Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defimpl

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