Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defimpl

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