Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.nottrue

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

⇒ logic.propositional.falsezeroor

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