Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroor

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