Theorems · Definition · combinatorics
IndepMatroid.matroid
{α : Type u_1} → IndepMatroid α → Matroid αAn M : IndepMatroid α gives a Matroid α whose bases are the maximal M-independent sets.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Matroidstatement · cited by 1,258
- Maximalproof · cited by 211
- IndepMatroid.Indepproof · cited by 17
- IndepMatroidstatement and proof · cited by 15
- IndepMatroid.Eproof · cited by 11
- IndepMatroid.indep_maximalproof · cited by 0
Cited by9
Results whose statement or proof uses this declaration.
- Matroid.restrictproof · cited by 111
- Matroid.dualproof · cited by 79
- Matroid.comapproof · cited by 24
- AlgebraicIndependent.matroidproof · cited by 17
- Matroid.ofExistsMatroidproof · cited by 1
- IndepMatroid.matroid_Estatement and proof · cited by 0
- IndepMatroid.matroid_Indepstatement and proof · cited by 0
- IndepMatroid.matroid_IsBasestatement and proof · cited by 0
- IndepMatroid.matroid_indep_iffstatement · cited by 0