Theorems · Theorem · combinatorics
Matroid.insert_isBase_of_insert_indep
∀ {α : Type u_1} {M : Matroid α} {I : Set α} {e f : α},
e ∉ I → f ∉ I → M.IsBase (insert e I) → M.Indep (insert f I) → M.IsBase (insert f I)- Defined in
- Mathlib.Combinatorics.Matroid.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Matroidstatement and proof · cited by 1,258
- eq_or_neproof · cited by 1,117
- Matroid.Indepstatement and proof · cited by 367
- Matroid.IsBasestatement and proof · cited by 239
- Set.sdiff_singleton_eq_selfproof · cited by 38
- Set.insert_sdiff_of_memproof · cited by 22
- Matroid.IsBase.exchange_isBase_of_indepproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.