Theorems · Theorem · combinatorics
Matroid.IsCircuit.strong_multi_elimination_insert
∀ {α : Type u_1} {M : Matroid α} {ι : Type u_2} {J : Set α} (x : ι → α) (I : ι → Set α) (z : α),
(∀ (i : ι), x i ∉ I i) →
(∀ (i : ι), M.IsCircuit (insert (x i) (I i))) →
M.IsCircuit (J ∪ Set.range x) → z ∈ J → (∀ (i : ι), z ∉ I i) → ∃ C' ⊆ J ∪ ⋃ i, I i, M.IsCircuit C' ∧ z ∈ C'A version of Matroid.IsCircuit.strong_multi_elimination that is phrased using insertion.
- Defined in
- Mathlib.Combinatorics.Matroid.Circuit
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 93 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites31
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
- Set.rangestatement and proof · cited by 4,705
- Set.iUnionstatement and proof · cited by 2,483
- Matroidstatement and proof · cited by 1,258
- IsEmptyproof · cited by 759
- Matroid.closureproof · cited by 272
- isEmpty_or_nonemptyproof · cited by 269
- Set.sdiff_subsetproof · cited by 156
- Set.subset_union_leftproof · cited by 142
- Set.insert_eq_of_memproof · cited by 118
- Matroid.IsCircuitstatement and proof · cited by 108
- Set.union_commproof · cited by 99
Cited by1
Results whose statement or proof uses this declaration.
- Matroid.IsCircuit.strong_multi_eliminationproof · cited by 2