Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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