Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notfalse

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