Theorems · Theorem · combinatorics
Matroid.delete_delete
∀ {α : Type u_1} (M : Matroid α) (D₁ D₂ : Set α), (M.delete D₁).delete D₂ = M.delete (D₁ ∪ D₂)- Cited by
- 8 results in Mathlib
- Foundations
- Depth 81 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
- Matroidstatement and proof · cited by 1,258
- Matroid.Eproof · cited by 550
- Matroid.restrictproof · cited by 111
- Matroid.deletestatement and proof · cited by 86
- Matroid.restrict_ground_eqproof · cited by 15
- Set.sdiff_sdiffproof · cited by 10
- Matroid.restrict_complproof · cited by 8
- Matroid.restrict_restrict_eqproof · cited by 6
Cited by8
Results whose statement or proof uses this declaration.
- Matroid.contract_contractproof · cited by 5
- Matroid.IsBasis.contract_eq_contract_deleteproof · cited by 3
- Matroid.contract_delete_contract_delete'proof · cited by 2
- Matroid.delete_contract_delete'proof · cited by 1
- Matroid.delete_delete_eq_delete_sdiffproof · cited by 1
- Matroid.IsRestriction.restrict_delete_of_disjointproof · cited by 1
- Matroid.delete_commproof · cited by 0
- Matroid.contract_closure_eq_contract_deleteproof · cited by 0