Theorem: Matroid.basis_loops_iff (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 α
⊢ M.Basis I (M.cl ∅) ↔ I = ∅
Tactic:
refine ⟨fun h ↦ h.indep.eq_empty_of_subset_loops h.subset, ?_⟩
State after:
α : Type u_1
β : Type u_2
M N : Matroid α
e f : α
B L L' I X Y Z F C K : Set α
⊢ I = ∅ → M.Basis I (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 α
⊢ I = ∅ → M.Basis I (M.cl ∅)
Tactic:
rintro rfl
State after:
α : Type u_1
β : Type u_2
M N : Matroid α
e f : α
B L L' X Y Z F C K : Set α
⊢ M.Basis ∅ (M.cl ∅)

State before:
α : Type u_1
β : Type u_2
M N : Matroid α
e f : α
B L L' X Y Z F C K : Set α
⊢ M.Basis ∅ (M.cl ∅)
Tactic:
exact M.empty_indep.basis_cl
State after:
no goals