Theorems · Theorem · combinatorics
Infinite.of_injective_to_set
∀ {α : Type u_1} {s : Set α}, s ≠ Set.univ → ∀ {f : α → ↑s}, Function.Injective f → Infinite αIf s : Set α is a proper subset of α and f : α → s is injective, then α is infinite.
- Defined in
- Mathlib.Data.Fintype.EquivFin
- Cited by
- 1 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.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Fintypeproof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- Set.univstatement and proof · cited by 3,945
- Fintype.cardproof · cited by 1,386
- Infinitestatement · cited by 352
- lt_irreflproof · cited by 190
- Set.toFinset_cardproof · cited by 63
- Finset.card_lt_cardproof · cited by 23
- Fintype.card_le_of_injectiveproof · cited by 19
- Set.ssubset_univ_iffproof · cited by 4
- Set.toFinset_ssubset_univproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Infinite.of_surjective_from_setproof · cited by 0