We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 44d96dd commit 2c3ad9aCopy full SHA for 2c3ad9a
1 file changed
Mathlib/SetTheory/Cardinal/Pigeonhole.lean
@@ -107,7 +107,6 @@ theorem exists_uncountable_fiber {β α : Type u} (f : β → α) (h : #α < #β
107
/-- If an infinite type `β` can be expressed as a union of finite sets,
108
then the cardinality of the collection of those finite sets
109
must be at least the cardinality of `β`. -/
110
--- TODO: write `Set.univ` instead of `⊤` and rename the theorem accordingly.
111
theorem le_range_of_union_finset_eq_univ {α β : Type*} [Infinite β] (f : α → Finset β)
112
(w : ⋃ a, (f a : Set β) = Set.univ) : #β ≤ #(range f) := by
113
by_contra h
0 commit comments