Theorem: Matroid.er_insert_cl_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 : α
M : Matroid α
e : α
X : Set α
⊢ M.er (insert e (M.cl X)) = M.er (insert e X)
Tactic:
rw [← union_singleton, er_union_cl_left_eq, union_singleton]
State after:
no goals