Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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