Mathlib Map

Theorems · Theorem · combinatorics

Matroid.Indep.indep_delete_of_disjoint

∀ {α : Type u_1} {M : Matroid α} {I D : Set α}, M.Indep I → Disjoint I D → (M.delete D).Indep I
Defined in
Mathlib.Combinatorics.Matroid.Minor.Delete
Cited by
1 results in Mathlib
Foundations
Depth 81 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.indep_iff_delete_of_disjoint · cited by 0Matroid.indep_iff_delete_…Set · cited by 53352SetDisjoint · cited by 2201DisjointMatroid · cited by 1258MatroidMatroid.Indep · cited by 367Matroid.IndepMatroid.delete · cited by 86Matroid.deleteMatroid.delete_indep_iff · cited by 7Matroid.delete_indep_iffIndep.indep_delete_of_disjointCITED BYCITES

Cites6

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

Cited by1

Results whose statement or proof uses this declaration.