Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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