Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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