Theorems · Theorem · combinatorics
Function.Embedding.exists_of_card_eq_finset
∀ {α : Type u_1} {β : Type u_2} [inst : Fintype α] {s : Finset β},
Fintype.card α = s.card → ∃ f, Finset.map f Finset.univ = s- Defined in
- Mathlib.Data.Fintype.EquivFin
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
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
- SetLike.coeproof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.imageproof · cited by 5,609
- Set.rangeproof · cited by 4,705
- Finset.univstatement and proof · cited by 3,473
- Finset.cardstatement and proof · cited by 2,327
- Fintype.cardstatement and proof · cited by 1,386
- Function.Embeddingstatement and proof · cited by 988
- Finset.mapstatement · cited by 747
- Set.image_univproof · cited by 322
Cited by3
Results whose statement or proof uses this declaration.
- Set.powersetCard.mulActionHom_of_embedding_surjectiveproof · cited by 1
- Set.powersetCard.addActionHom_of_embedding_surjectiveproof · cited by 1
- Set.powersetCard.ofFinEmb_surjectiveproof · cited by 0