Theorems · Theorem · combinatorics
Finset.eq_of_mem_insert_of_notMem
∀ {α : Type u_1} [inst : DecidableEq α] {s : Finset α} {a b : α}, b ∈ insert a s → b ∉ s → b = a- Defined in
- Mathlib.Data.Finset.Insert
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.mem_insertproof · cited by 44
Cited by4
Results whose statement or proof uses this declaration.
- Finset.insert_injproof · cited by 1
- Order.exists_orderEmbedding_insertproof · cited by 1
- IsAddKleinFour.eq_add_of_ne_allproof · cited by 0
- IsKleinFour.eq_mul_of_ne_allproof · cited by 0