Theorems · Theorem · combinatorics
Fintype.card_le_of_injective
∀ {α : Type u_1} {β : Type u_2} [inst : Fintype α] [inst_1 : Fintype β] (f : α → β),
Function.Injective f → Fintype.card α ≤ Fintype.card β- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetLike.coeproof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Fintype.cardstatement · cited by 1,386
- Finset.mem_univproof · cited by 361
- Finset.card_le_card_of_injOnproof · cited by 16
Cited by19
Results whose statement or proof uses this declaration.
- Fintype.card_le_of_embeddingproof · cited by 11
- Fintype.card_le_of_surjectiveproof · cited by 10
- SimplexCategory.len_le_of_monoproof · cited by 8
- Set.card_le_cardproof · cited by 5
- Fintype.card_le_one_iffproof · cited by 4
- Configuration.HasLines.pointCount_le_lineCountproof · cited by 4
- FixedPoints.finrank_eq_cardproof · cited by 3
- OrderedFinpartition.length_leproof · cited by 2
- OrderedFinpartition.partSize_leproof · cited by 2
- AddChar.card_eqproof · cited by 2
- SimpleGraph.Copy.degree_leproof · cited by 1
- FixedPoints.toAlgHom_bijectiveproof · cited by 1