Theorem: Matroid.Base.modularBase_of_forall_subset_cl (Matroid/Modular.lean)

State before:
ι : Type u_1
α : Type u_2
M : Matroid α
B I J X X' Y Y' F : Set α
Xs Ys Js Is : ι → Set α
i j : ι
e f : α
hB : M.Base B
h : ∀ (i : ι), Xs i ⊆ M.cl (Xs i ∩ B)
⊢ M.ModularBase B Xs
Tactic:
exact ⟨hB, fun i ↦ hB.indep.inter_basis_cl_iff_subset_cl_inter.2 (h i)⟩
State after:
no goals