Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.truezeroand

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