Theorems · Theorem · combinatorics
Finset.card_map
∀ {α : Type u_1} {β : Type u_2} {s : Finset α} (f : α ↪ β), (Finset.map f s).card = s.card- Defined in
- Mathlib.Data.Finset.Card
- Cited by
- 114 results in Mathlib
- Foundations
- Depth 27 from the axioms, rests on 160 definitions · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Finset.cardstatement · cited by 2,327
- Function.Embeddingstatement and proof · cited by 988
- Finset.mapstatement · cited by 747
- Finset.valproof · cited by 438
- Multiset.card_mapproof · cited by 57
Cited by114
Results whose statement or proof uses this declaration.
- Fintype.card_piFinsetproof · cited by 10
- Int.card_Iccproof · cited by 6
- Int.card_Icoproof · cited by 6
- Infinite.exists_subset_card_eqproof · cited by 5
- Int.card_Iocproof · cited by 5
- Fintype.card_optionproof · cited by 5
- Set.Infinite.exists_subset_card_eqproof · cited by 4
- Finset.card_sigmaLiftproof · cited by 4
- Fintype.card_lt_of_injective_of_notMemproof · cited by 4
- Multiset.card_Iccproof · cited by 4
- SimpleGraph.cliqueSet_mapproof · cited by 3
- addRothNumber_map_add_leftproof · cited by 3