Theorem: Matroid.delete_empty (Matroid/Minor/Basic.lean)

State before:
α : Type u_1
M✝ M' N : Matroid α
e f : α
I J R✝ B X Y Z K D D₁ D₂ R : Set α
M : Matroid α
⊢ M ＼ ∅ = M
Tactic:
rw [delete_eq_self_iff]
State after:
α : Type u_1
M✝ M' N : Matroid α
e f : α
I J R✝ B X Y Z K D D₁ D₂ R : Set α
M : Matroid α
⊢ Disjoint ∅ M.E

State before:
α : Type u_1
M✝ M' N : Matroid α
e f : α
I J R✝ B X Y Z K D D₁ D₂ R : Set α
M : Matroid α
⊢ Disjoint ∅ M.E
Tactic:
exact empty_disjoint _
State after:
no goals