Theorems · Definition · combinatorics
Finset.sigma
{ι : Type u_1} → {α : ι → Type u_2} → Finset ι → ((i : ι) → Finset (α i)) → Finset ((i : ι) × α i)s.sigma t is the finset of dependent pairs ⟨i, a⟩ such that i ∈ s and a ∈ t i.
- Defined in
- Mathlib.Data.Finset.Sigma
- Cited by
- 69 results in Mathlib
- Foundations
- Depth 62 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.valproof · cited by 438
- Multiset.sigmaproof · cited by 9
Cited by74
Results whose statement or proof uses this declaration.
- Finset.sum_sigma'statement · cited by 23
- Finset.sum_sigmastatement · cited by 12
- Finset.prod_sigmastatement · cited by 10
- Finset.mem_sigmastatement · cited by 9
- Equiv.Perm.finPairsLTproof · cited by 9
- sigmaFinsuppEquivDFinsuppproof · cited by 8
- FormalMultilinearSeries.compPartialSumSourceproof · cited by 8
- HasSum.sigmaproof · cited by 8
- Finset.prod_sigma'statement · cited by 7
- Finset.univ_sigma_univstatement · cited by 6
- HasProd.sigmaproof · cited by 5
- Finset.coe_sigmastatement · cited by 5