Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defequiv

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