Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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