Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.falsezeroor

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