Theorems · Theorem · combinatorics
Matroid.delete_indep_iff
∀ {α : Type u_1} {M : Matroid α} {I D : Set α}, (M.delete D).Indep I ↔ M.Indep I ∧ Disjoint I D- Cited by
- 7 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Disjointstatement and proof · cited by 2,201
- Matroidstatement and proof · cited by 1,258
- Matroid.Indepstatement and proof · cited by 367
- Matroid.deletestatement · cited by 86
- Matroid.Indep.subset_groundproof · cited by 61
- Set.subset_sdiffproof · cited by 29
- Matroid.restrict_indep_iffproof · cited by 13
- Matroid.restrict_complproof · cited by 8
Cited by7
Results whose statement or proof uses this declaration.
- Matroid.IsBasis'.contract_indep_iffproof · cited by 4
- Matroid.IsBasis.contract_eq_contract_deleteproof · cited by 3
- Matroid.Indep.of_deleteproof · cited by 2
- Matroid.delete_dep_iffproof · cited by 2
- Matroid.delete_isNonloop_iffproof · cited by 2
- Matroid.Indep.indep_delete_of_disjointproof · cited by 1
- Matroid.coindep_contract_iffproof · cited by 1