Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroor

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