Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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