Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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