Theorems · Definition · combinatorics
Matroid.mapSetEquiv
{α : Type u_1} → {β : Type u_2} → (M : Matroid α) → {E : Set β} → ↑M.E ≃ ↑E → Matroid βMap M : Matroid α to a Matroid β with ground set E using an equivalence M.E ≃ E.
Defined using Matroid.ofExistsMatroid for better defeq.
- Defined in
- Mathlib.Combinatorics.Matroid.Map
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Equivstatement and proof · cited by 8,337
- Set.Elemstatement and proof · cited by 7,166
- Set.imageproof · cited by 5,609
- Set.preimageproof · cited by 4,946
- Equiv.symmproof · cited by 3,681
- Matroidstatement and proof · cited by 1,258
- Matroid.Estatement and proof · cited by 550
- Matroid.Indepproof · cited by 367
- Matroid.ofExistsMatroidproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Matroid.mapSetEquiv_indep_iffstatement · cited by 0
- Matroid.mapSetEquiv.groundstatement · cited by 0