Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notfalse

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