Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.idempor

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