Theorems · Inductive type · combinatorics
Matroid.RankFinite
{α : Type u_1} → Matroid α → PropA RankFinite matroid is one whose bases are finite
- Defined in
- Mathlib.Combinatorics.Matroid.Basic
- Cited by
- 33 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 by36
Results whose statement or proof uses this declaration.
- Matroid.IsRkFiniteproof · cited by 53
- Matroid.IsBase.finitestatement and proof · cited by 7
- Matroid.Indep.finitestatement and proof · cited by 4
- Matroid.rankFinite_iff_cRank_lt_aleph0statement and proof · cited by 3
- Matroid.IsBase.rankFinite_of_finitestatement · cited by 3
- Matroid.IsBasis'.finite_iff_isRkFiniteproof · cited by 3
- Matroid.not_rankFinite_iffstatement and proof · cited by 3
- Matroid.rankFinite_or_rankInfinitestatement and proof · cited by 2
- Matroid.IsRkFinite.finite_of_isBasis'proof · cited by 2
- Matroid.RankFinite.exists_finite_isBasestatement and proof · cited by 2
- Matroid.Indep.isBase_of_cRank_lestatement and proof · cited by 2
- Matroid.indep_iff_eRk_eq_encardstatement and proof · cited by 1