Theorem: Matroid.cl_insert_cl_eq_cl_insert (Matroid/Closure.lean)

State before:
α : Type u_1
ι : Type u_2
M✝ : Matroid α
F I J X✝ Y B C R : Set α
e✝ f x y : α
M : Matroid α
e : α
X : Set α
⊢ M.cl (insert e (M.cl X)) = M.cl (insert e X)
Tactic:
simp_rw [← singleton_union, cl_union_cl_right_eq]
State after:
no goals