Theorem: Matroid.rFin.to_cl (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 : α
h : M.rFin X
⊢ M.rFin (M.cl X)
Tactic:
rwa [← er_lt_top_iff, er_cl_eq]
State after:
no goals