Theorems · Theorem · combinatorics
Fintype.card_le_of_embedding
∀ {α : Type u_1} {β : Type u_2} [inst : Fintype α] [inst_1 : Fintype β] (f : α ↪ β), Fintype.card α ≤ Fintype.card β- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 81 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.
- DFunLike.coeproof · cited by 62,936
- Fintypestatement and proof · cited by 7,736
- Fintype.cardstatement · cited by 1,386
- Function.Embeddingstatement and proof · cited by 988
- Function.Embedding.inj'proof · cited by 29
- Fintype.card_le_of_injectiveproof · cited by 19
Cited by11
Results whose statement or proof uses this declaration.
- Module.length_compositionSeriesproof · cited by 4
- Fintype.card_subtype_leproof · cited by 4
- set_fintype_card_le_univproof · cited by 2
- ruzsaSzemerediNumber_monoproof · cited by 2
- Function.Embedding.nonempty_iff_card_leproof · cited by 2
- SimpleGraph.bot_isContained_iff_card_leproof · cited by 1
- Module.Basis.SmithNormalForm.toAddSubgroup_index_eq_iteproof · cited by 1
- Fin.le_of_embeddingproof · cited by 0
- Fintype.card_subtype_monoproof · cited by 0
- Fintype.card_subtype_orproof · cited by 0
- SimpleGraph.cliqueFree_of_card_ltproof · cited by 0