Theorems · Theorem · logic and foundations
Set.Finite.finite_of_encard_le
∀ {α : Type u_1} {β : Type u_2} {s : Set α} {t : Set β}, s.Finite → t.encard ≤ s.encard → t.Finite- Defined in
- Mathlib.Data.Set.Card
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- ENatstatement · cited by 4,985
- Set.Finitestatement and proof · cited by 1,814
- LE.le.trans_ltproof · cited by 795
- Set.encardstatement and proof · cited by 327
- Set.Finite.encard_lt_topproof · cited by 10
- Set.encard_lt_top_iffproof · cited by 5
Cited by2
Results whose statement or proof uses this declaration.
- Set.Finite.eq_of_subset_of_encard_leproof · cited by 8
- Set.ncard_le_ncard_of_injOnproof · cited by 1