Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notfalse

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