Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroor

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