Theorem: Matroid.simplification_removeLoops_eq (Matroid/Simple.lean)

State before:
α : Type u_1
M✝ N : Matroid α
e f g : α
I X P D : Set α
M : Matroid α
⊢ M.removeLoops.simplification = M.simplification
Tactic:
rw [removeLoops_eq_delete, simplification_delete_eq_of_subset_loops M Subset.rfl]
State after:
no goals