Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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