Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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