Theorem: Matroid.rFin_iff' (Matroid/Rank.lean)

State before:
α : Type u_1
ι : Type u_2
M N : Matroid α
I✝ B X X' Y Y' Z R : Set α
n : ℕ∞
e f : α
x✝ : ∃ I, M.Basis' I X ∧ I.Finite
I : Set α
hI : M.Basis' I X
hIfin : I.Finite
⊢ M.rFin X
Tactic:
rwa [← er_lt_top_iff, hI.er_eq_encard, encard_lt_top_iff]
State after:
no goals