Mathlib Map

Theorems · Definition · combinatorics

Matroid.RankPos.casesOn

{α : Type u_1} →
  {M : Matroid α} →
    {motive : M.RankPos → Sort u} → (t : M.RankPos) → ((empty_not_isBase : ¬M.IsBase ∅) → motive ⋯) → motive t
Defined in
Mathlib.Combinatorics.Matroid.Basic
Cited by
1 results in Mathlib
Foundations
Depth 5 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Matroid.rankPos_iff · cited by 6Matroid.rankPos_iffSet · cited by 53352SetMatroid · cited by 1258MatroidMatroid.IsBase · cited by 239Matroid.IsBaseMatroid.RankPos · cited by 22Matroid.RankPosRankPos.casesOnCITED BYCITES

Cites4

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.