Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroor

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