Theorems · Theorem · combinatorics
Matroid.indep_iff_eRk_eq_encard
∀ {α : Type u_1} {M : Matroid α} {I : Set α} [M.RankFinite], M.Indep I ↔ M.eRk I = I.encardIn a matroid known to have finite rank, Matroid.indep_iff_eRk_eq_encard_of_finite
is true without the finiteness assumption.
- Defined in
- Mathlib.Combinatorics.Matroid.Rank.ENat
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 114 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Matroid.RankFinite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
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
- ENatstatement and proof · cited by 4,985
- Set.Finiteproof · cited by 1,814
- Matroidstatement and proof · cited by 1,258
- LT.lt.neproof · cited by 872
- Matroid.Indepstatement · cited by 367
- Set.encardstatement and proof · cited by 327
- Set.Infiniteproof · cited by 263
- Matroid.eRkstatement and proof · cited by 101
- Matroid.RankFinitestatement and proof · cited by 33
- Set.finite_or_infiniteproof · cited by 23
- Matroid.Indep.eRk_eq_encardproof · cited by 15
Cited by1
Results whose statement or proof uses this declaration.
- Matroid.Dep.eRk_lt_encardproof · cited by 1