Theorems · Inductive type · combinatorics
Matroid.RankPos
{α : Type u_1} → Matroid α → PropA RankPos matroid is one whose bases are nonempty.
- Defined in
- Mathlib.Combinatorics.Matroid.Basic
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Matroidstatement · cited by 1,258
Cited by24
Results whose statement or proof uses this declaration.
- Matroid.rankPos_iffstatement and proof · cited by 6
- Matroid.dual_rankPos_iff_exists_isCircuitstatement · cited by 3
- Matroid.empty_not_isBasestatement and proof · cited by 2
- Matroid.IsBase.nonemptystatement and proof · cited by 2
- Matroid.ground_not_isBasestatement and proof · cited by 1
- Matroid.Indep.rankPos_of_nonemptystatement · cited by 1
- Matroid.exists_isCircuitstatement and proof · cited by 1
- Matroid.RankPos.casesOnstatement and proof · cited by 1
- Matroid.RankPos.empty_not_isBasestatement and proof · cited by 1
- Matroid.IsBase.rankPos_of_nonemptystatement · cited by 1
- Matroid.IsBase.ssubset_groundstatement and proof · cited by 1
- Matroid.one_le_eRankstatement and proof · cited by 0