Theorems · Definition · combinatorics
Finset.product
{α : Type u_1} → {β : Type u_2} → Finset α → Finset β → Finset (α × β)product s t is the set of pairs (a, b) such that a ∈ s and b ∈ t.
- Defined in
- Mathlib.Data.Finset.Prod
- Cited by
- 6 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
- SProd.sprodproof · cited by 1,750
- Finset.valproof · cited by 438
Cited by7
Results whose statement or proof uses this declaration.
- PairReduction.pairSetSeqproof · cited by 4
- PairReduction.card_pairSetSeq_le_logSizeRadius_mulproof · cited by 1
- SzemerediRegularity.edgeDensity_chunk_not_uniformstatement and proof · cited by 1
- SzemerediRegularity.edgeDensity_chunk_uniformstatement and proof · cited by 1
- Finset.product_eq_sprodstatement · cited by 0
- SkewMonoidAlgebra.coeff_mul_antidiagonal_finsumproof · cited by 0
- Finset.supIndep_product_iffstatement and proof · cited by 0