Theorem: Matroid.rFin.coe_r_eq (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 : α
hX : M.rFin X
⊢ ↑(M.r X) = M.er X
Tactic:
rw [r, coe_toNat (by rwa [er_ne_top_iff])]
State after:
no goals

State before:
α : Type u_1
ι : Type u_2
M N : Matroid α
I B X X' Y Y' Z R : Set α
n : ℕ∞
e f : α
hX : M.rFin X
⊢ M.er X ≠ ⊤
Tactic:
rwa [er_ne_top_iff]
State after:
no goals