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.truezeroand

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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