Theorem: Matroid.Base.mapEmbedding (Matroid/Map.lean)

State before:
α : Type u_1
β : Type u_2
f✝ : α → β
E I s : Set α
M : Matroid α
N : Matroid β
B : Set α
hB : M.Base B
f : α ↪ β
⊢ (M.mapEmbedding f).Base (⇑f '' B)
Tactic:
rw [Matroid.mapEmbedding, map_base_iff]
State after:
α : Type u_1
β : Type u_2
f✝ : α → β
E I s : Set α
M : Matroid α
N : Matroid β
B : Set α
hB : M.Base B
f : α ↪ β
⊢ ∃ B₀, M.Base B₀ ∧ ⇑f '' B = ⇑f '' B₀

State before:
α : Type u_1
β : Type u_2
f✝ : α → β
E I s : Set α
M : Matroid α
N : Matroid β
B : Set α
hB : M.Base B
f : α ↪ β
⊢ ∃ B₀, M.Base B₀ ∧ ⇑f '' B = ⇑f '' B₀
Tactic:
exact ⟨B, hB, rfl⟩
State after:
no goals