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

State before:
α : Type u_1
M✝ N : Matroid α
e f g : α
I X P D : Set α
M : Matroid α
⊢ M.simplification.simplification = M.simplification
Tactic:
rw [simplification_eq_self_iff]
State after:
α : Type u_1
M✝ N : Matroid α
e f g : α
I X P D : Set α
M : Matroid α
⊢ M.simplification.Simple

State before:
α : Type u_1
M✝ N : Matroid α
e f g : α
I X P D : Set α
M : Matroid α
⊢ M.simplification.Simple
Tactic:
exact M.simplification_simple
State after:
no goals