Theorems · Inductive type · combinatorics
Matroid.RankInfinite
{α : Type u_1} → Matroid α → PropAn RankInfinite matroid is one whose bases are infinite.
- Defined in
- Mathlib.Combinatorics.Matroid.Basic
- Cited by
- 13 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 by15
Results whose statement or proof uses this declaration.
- Matroid.not_rankFinite_iffstatement and proof · cited by 3
- Matroid.IsBase.infinitestatement and proof · cited by 2
- Matroid.rankFinite_or_rankInfinitestatement and proof · cited by 2
- Matroid.RankInfinite.casesOnstatement and proof · cited by 1
- Matroid.RankInfinite.exists_infinite_isBasestatement and proof · cited by 1
- Matroid.toENat_cRank_eqproof · cited by 1
- Matroid.rankInfinite_iff_aleph0_le_cRankstatement and proof · cited by 1
- Matroid.eRank_eq_topstatement and proof · cited by 1
- Matroid.eRank_eq_top_iffstatement · cited by 1
- Matroid.IsBase.rankInfinite_of_infinitestatement · cited by 1
- Matroid.not_rankFinitestatement and proof · cited by 1
- Matroid.not_rankInfinitestatement and proof · cited by 1