Theorems · Theorem · combinatorics

Matroid.Indep.exists_bijOn_of_map

∀ {α : Type u_1} {β : Type u_2} {f : α → β} {M : Matroid α} {I : Set β} (hf : Set.InjOn f M.E),
  (M.map f hf).Indep I → ∃ I₀, M.Indep I₀ ∧ Set.BijOn f I₀ I

Defined in

Mathlib.Combinatorics.Matroid.Map

Cited by

1 results in Mathlib

Foundations

Depth 94 from the axioms · uses propext, Classical.choice, Quot.sound