Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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