Mathlib Map

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.

Cited by1

Results whose statement or proof uses this declaration.