Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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