Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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