Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.idempor

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