Mathlib Map

Theorems · Theorem · combinatorics

Matroid.mapEquiv_eq_map

∀ {α : Type u_1} {β : Type u_2} {M : Matroid α} (f : α ≃ β), M.mapEquiv f = M.map ⇑f ⋯
Defined in
Mathlib.Combinatorics.Matroid.Map
Cited by
4 results in Mathlib
Foundations
Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Matroid.mapEquiv_dep_iff · cited by 0Matroid.mapEquiv_dep_iffMatroid.mapEquiv_indep_iff · cited by 0Matroid.mapEquiv_indep_iffMatroid.mapEquiv_isBase_iff · cited by 0Matroid.mapEquiv_isBase_i…Matroid.mapEquiv_isBasis_iff · cited by 0Matroid.mapEquiv_isBasis_…DFunLike.coe · cited by 62936DFunLike.coeEquiv · cited by 8337EquivMatroid · cited by 1258MatroidMatroid.E · cited by 550Matroid.EEquiv.injective · cited by 464Equiv.injectiveFunction.Injective.injOn · cited by 280Injective.injOnMatroid.map · cited by 32Matroid.mapMatroid.mapEquiv · cited by 10Matroid.mapEquivMatroid.mapEquiv_eq_mapCITED BYCITES

Cites8

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by4

Results whose statement or proof uses this declaration.