Theorem: Matroid.LoopEquiv.diff_subset_loops (Matroid/Loop.lean)

State before:
α : Type u_1
β : Type u_2
M N : Matroid α
e f : α
B L L' I X Y Z F C K : Set α
h : M.LoopEquiv X Y
⊢ X \ Y ⊆ M.cl ∅
Tactic:
rw [diff_subset_iff, ← h.union_eq_union]
State after:
α : Type u_1
β : Type u_2
M N : Matroid α
e f : α
B L L' I X Y Z F C K : Set α
h : M.LoopEquiv X Y
⊢ X ⊆ X ∪ M.cl ∅

State before:
α : Type u_1
β : Type u_2
M N : Matroid α
e f : α
B L L' I X Y Z F C K : Set α
h : M.LoopEquiv X Y
⊢ X ⊆ X ∪ M.cl ∅
Tactic:
exact subset_union_left
State after:
no goals