Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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