Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
¬(q → (p ∧ p)) ↔ ((r ↔ s) ∨ (¬(s ∧ s) ∧ T) ∨ (r ↔ s) ∨ ¬(s ∧ s))
⇒ logic.propositional.truezeroand¬(q → (p ∧ p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))
⇒ logic.propositional.idempand¬(q → (p ∧ p)) ↔ ((r ↔ s) ∨ ¬s ∨ (r ↔ s) ∨ ¬(s ∧ s))