Theorems · Theorem · order theory
Set.Finite.fin_embedding
∀ {α : Type u} {s : Set α}, s.Finite → ∃ n f, Set.range ⇑f = s- Defined in
- Mathlib.Data.Set.Finite.Lemmas
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Setstatement and proof · cited by 53,352
- SetLike.coeproof · cited by 8,199
- Set.Elemproof · cited by 7,166
- Set.ofPredproof · cited by 6,101
- Set.rangestatement · cited by 4,705
- Equiv.symmproof · cited by 3,681
- Set.Finitestatement and proof · cited by 1,814
- Fintype.cardproof · cited by 1,386
- Function.Embeddingstatement · cited by 988
- Set.Finite.toFinsetproof · cited by 351
- Set.Finite.coe_toFinsetproof · cited by 124
Cited by3
Results whose statement or proof uses this declaration.
- Submodule.fg_iff_exists_fin_generating_familyproof · cited by 6
- Set.Finite.fin_paramproof · cited by 1
- FirstOrder.Language.Substructure.fg_iff_exists_fin_generating_familyproof · cited by 0