Mathlib Map

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.encard

In 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.

Cited by1

Results whose statement or proof uses this declaration.