Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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