Theorems · Theorem · logic and foundations
Cardinal.infinite_pigeonhole_card
∀ {β α : Type u} (f : β → α),
∀ θ ≤ Cardinal.mk β, Cardinal.aleph0 ≤ θ → Cardinal.mk α < θ.ord.cof → ∃ a, θ ≤ Cardinal.mk ↑(f ⁻¹' {a})Pigeonhole principle for a cardinality below the cardinality of the domain
- Defined in
- Mathlib.SetTheory.Cardinal.Pigeonhole
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 103 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.
- Setstatement and proof · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- Set.preimagestatement and proof · cited by 4,946
- Cardinalstatement and proof · cited by 2,598
- Cardinal.mkstatement and proof · cited by 942
- Cardinal.aleph0statement and proof · cited by 521
- Cardinal.ordstatement and proof · cited by 266
- Subtype.val_injectiveproof · cited by 232
- Ordinal.cofstatement and proof · cited by 125
- Set.preimage_compproof · cited by 57
- Cardinal.le_mk_iff_exists_setproof · cited by 6
- Cardinal.mk_preimage_of_injectiveproof · cited by 3
Cited by4
Results whose statement or proof uses this declaration.
- Cardinal.infinite_pigeonhole_card_ltproof · cited by 2
- Cardinal.exists_infinite_fiberproof · cited by 2
- Cardinal.exists_uncountable_fiberproof · cited by 0
- Cardinal.infinite_pigeonhole_setproof · cited by 0