Theorem: Matroid.Flat.cl_subset_of_subset (Matroid/Flat.lean)

State before:
α : Type u_1
M : Matroid α
I F X Y F' F₀ F₁ F₂ P L H H₁ H₂ H' B C K : Set α
e f : α
hF : M.Flat F
h : X ⊆ F
⊢ M.cl X ⊆ F
Tactic:
have h' := M.cl_mono h
State after:
α : Type u_1
M : Matroid α
I F X Y F' F₀ F₁ F₂ P L H H₁ H₂ H' B C K : Set α
e f : α
hF : M.Flat F
h : X ⊆ F
h' : M.cl X ≤ M.cl F
⊢ M.cl X ⊆ F

State before:
α : Type u_1
M : Matroid α
I F X Y F' F₀ F₁ F₂ P L H H₁ H₂ H' B C K : Set α
e f : α
hF : M.Flat F
h : X ⊆ F
h' : M.cl X ≤ M.cl F
⊢ M.cl X ⊆ F
Tactic:
rwa [hF.cl] at h'
State after:
no goals