Theorems · Definition · combinatorics
Set.powersetCard
(α : Type u_1) → ℕ → Set (Finset α)
The type of combinations of n elements of a type α.
See also Finset.powersetCard.
- Defined in
- Mathlib.Data.Set.PowersetCard
- Cited by
- 100 results in Mathlib
- Foundations
- Depth 13 from the axioms, rests on 50 definitions · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- Set.ofPredproof · cited by 6,101
- Finset.cardproof · cited by 2,327
Cited by125
Results whose statement or proof uses this declaration.
- exteriorPower.ιMulti_familystatement and proof · cited by 17
- Module.Basis.exteriorPowerstatement · cited by 12
- Set.powersetCard.ofFinEmbEquivstatement and proof · cited by 11
- ExteriorAlgebra.ιMulti_familystatement and proof · cited by 9
- Set.powersetCard.ofCardstatement · cited by 6
- exteriorPower.ιMultiDualstatement and proof · cited by 6
- Set.powersetCard.cardstatement and proof · cited by 5
- Set.powersetCard.disjUnionstatement and proof · cited by 5
- Set.powersetCard.mulActionHom_complstatement and proof · cited by 5
- Set.powersetCard.ofFinEmbstatement · cited by 5
- Set.powersetCard.complstatement and proof · cited by 4
- ExteriorAlgebra.basis_apply_powersetCardstatement and proof · cited by 3