Theorems · Theorem · combinatorics
Finset.mem_cons
∀ {α : Type u_1} {s : Finset α} {a b : α} {h : a ∉ s}, b ∈ Finset.cons a s h ↔ b = a ∨ b ∈ s- Defined in
- Mathlib.Data.Finset.Insert
- Cited by
- 35 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.consstatement · cited by 221
- Multiset.mem_consproof · cited by 29
Cited by35
Results whose statement or proof uses this declaration.
- Finset.cons_nonemptyproof · cited by 12
- Finset.exists_mem_eq_sup'proof · cited by 9
- Finset.noncommProd_insert_of_notMemproof · cited by 8
- Finset.forall_of_forall_consproof · cited by 5
- Finset.noncommProd_consstatement and proof · cited by 4
- Finset.le_sup_iffproof · cited by 4
- Finset.Nonempty.norm_sum_le_sup'_normproof · cited by 4
- StrictConvexOn.map_sum_ltproof · cited by 3
- Finset.noncommSum_consstatement and proof · cited by 3
- Finset.noncommSum_insert_of_notMemproof · cited by 3
- ArchimedeanClass.mk_sumproof · cited by 2
- Finset.inf_le_iffproof · cited by 2