Theorem: Matroid.loopyOn_er_eq (Matroid/Rank.lean)

State before:
α : Type u_1
ι : Type u_2
M N : Matroid α
I B X✝ X' Y Y' Z R : Set α
n : ℕ∞
e f : α
E✝ E X : Set α
⊢ (loopyOn E).er X = 0
Tactic:
obtain ⟨I, hI⟩ := (loopyOn E).exists_basis' X
State after:
case intro
α : Type u_1
ι : Type u_2
M N : Matroid α
I✝ B X✝ X' Y Y' Z R : Set α
n : ℕ∞
e f : α
E✝ E X I : Set α
hI : (loopyOn E).Basis' I X
⊢ (loopyOn E).er X = 0

State before:
case intro
α : Type u_1
ι : Type u_2
M N : Matroid α
I✝ B X✝ X' Y Y' Z R : Set α
n : ℕ∞
e f : α
E✝ E X I : Set α
hI : (loopyOn E).Basis' I X
⊢ (loopyOn E).er X = 0
Tactic:
rw [hI.er_eq_encard, loopyOn_indep_iff.1 hI.indep, encard_empty]
State after:
no goals