Theorems · Definition · combinatorics

Matroid.RankInfinite.recOn

{α : Type u_1} →
  {M : Matroid α} →
    {motive : M.RankInfinite → Sort u} →
      (t : M.RankInfinite) → ((exists_infinite_isBase : ∃ B, M.IsBase B ∧ B.Infinite) → motive ⋯) → motive t

Defined in: Mathlib.Combinatorics.Matroid.Basic
Cited by: 0 results in Mathlib
Foundations: Depth 9 from the axioms · uses no axioms

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites5

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
Matroidstatement and proof · cited by 1,258
Set.Infinitestatement and proof · cited by 263
Matroid.IsBasestatement and proof · cited by 239
Matroid.RankInfinitestatement and proof · cited by 13

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.