Theorems · Theorem · logic and foundations
Fin.Embedding.exists_embedding_disjoint_range_of_add_le_Nat_card
∀ {α : Type u_1} {n : ℕ} {s : Set α} [Finite α], s.ncard + n ≤ Nat.card α → ∃ y, Disjoint s (Set.range ⇑y)- Defined in
- Mathlib.SetTheory.Cardinal.Embedding
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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
- ENatproof · cited by 4,985
- Set.rangestatement · cited by 4,705
- Finitestatement and proof · cited by 3,029
- Disjointstatement · cited by 2,201
- Function.Embeddingstatement · cited by 988
- Nat.cardstatement and proof · cited by 844
- Set.ncardstatement and proof · cited by 344
- ENat.cardproof · cited by 89
- ENat.natCast_le_natCastproof · cited by 19
- ENat.natCast_addproof · cited by 17
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.