Theorems · Definition · combinatorics
Finset.card
{α : Type u_1} → Finset α → ℕs.card is the number of elements of s, aka its cardinality.
The notation #s can be accessed in the Finset locale.
- Defined in
- Mathlib.Data.Finset.Card
- Cited by
- 2,327 results in Mathlib
- Foundations
- Depth 12 from the axioms, rests on 47 definitions · uses propext
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.cardproof · cited by 375
Cited by2,455
Results whose statement or proof uses this declaration.
- Fintype.cardproof · cited by 1,386
- Finset.sum_conststatement and proof · cited by 254
- Finset.prod_conststatement and proof · cited by 154
- Finset.card_singletonstatement · cited by 144
- Finset.card_le_cardstatement · cited by 118
- Finset.expectproof · cited by 116
- Finset.card_mapstatement · cited by 114
- SimpleGraph.degreeproof · cited by 112
- Nat.totientproof · cited by 111
- Finset.card_rangestatement · cited by 108
- Set.powersetCardproof · cited by 100
- Equiv.Perm.cycleTypeproof · cited by 87
Showing the 200 most cited of 2,455.