Theorems · Theorem · combinatorics
Finset.mem_coe
∀ {α : Type u_1} {a : α} {s : Finset α}, a ∈ ↑s ↔ a ∈ s- Defined in
- Mathlib.Data.Finset.Defs
- Cited by
- 91 results in Mathlib
- Foundations
- Depth 54 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.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement · cited by 8,199
Cited by91
Results whose statement or proof uses this declaration.
- MeasureTheory.SimpleFunc.inductionproof · cited by 14
- Matrix.det_fromBlocks_zero₂₁proof · cited by 10
- Polynomial.mem_rootSet'proof · cited by 8
- isOpen_pi_iffproof · cited by 6
- Finset.map_subtype_subsetproof · cited by 5
- IsDedekindDomain.mem_primesOverFinset_iffproof · cited by 4
- affineIndependent_iff_indicator_eq_of_affineCombination_eqproof · cited by 4
- AffineIndependent.eq_zero_of_affineCombination_mem_affineSpanproof · cited by 4
- Fintype.card_lt_of_injective_of_notMemproof · cited by 4
- Finset.convexHull_eqproof · cited by 4
- AddMonoid.exponent_ne_zero_iff_range_addOrderOf_finiteproof · cited by 3
- Finset.ruzsa_triangle_inequality_div_div_divproof · cited by 3