Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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