Theorem: infinite_iUnion (Matroid/ForMathlib/Data/Set/Finite.lean)

State before:
α : Type u_1
s✝ : Set α
ι : Type u_2
inst✝ : Infinite ι
s : ι → Set α
hs : Function.Injective s
hfin : (⋃ i, s i).Finite
i j : ι
h_eq : (fun i => ⟨s i, ⋯⟩) i = (fun i => ⟨s i, ⋯⟩) j
⊢ s i = s j
Tactic:
simpa using h_eq
State after:
no goals