Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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