Theorems · Theorem · logic and foundations
Set.Finite.exists_bijOn_of_encard_eq
∀ {α : Type u_1} {β : Type u_2} {s : Set α} {t : Set β} [Nonempty β],
s.Finite → s.encard = t.encard → ∃ f, Set.BijOn f s t- Defined in
- Mathlib.Data.Set.Card
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
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.
- Setstatement and proof · cited by 53,352
- Set.imageproof · cited by 5,609
- ENatstatement · cited by 4,985
- Set.preimageproof · cited by 4,946
- Set.Finitestatement and proof · cited by 1,814
- Eq.leproof · cited by 605
- Set.InjOnproof · cited by 543
- Set.encardstatement and proof · cited by 327
- Set.image_subset_iffproof · cited by 203
- Set.BijOnstatement and proof · cited by 168
- Set.Finite.imageproof · cited by 96
- Set.InjOn.bijOn_imageproof · cited by 20
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.