Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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