Theorem: Matroid.Indep.basis_cl (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 : α
hI : M.Indep I
⊢ M.Basis I (M.cl I)
Tactic:
rw [hI.cl_eq_setOf_basis_insert]
State after:
α : Type u_1
ι : Type u_2
M : Matroid α
F I J X Y B C R : Set α
e f x y : α
hI : M.Indep I
⊢ M.Basis I {x | M.Basis I (insert x I)}

State before:
α : Type u_1
ι : Type u_2
M : Matroid α
F I J X Y B C R : Set α
e f x y : α
hI : M.Indep I
⊢ M.Basis I {x | M.Basis I (insert x I)}
Tactic:
exact hI.basis_setOf_insert_basis
State after:
no goals