Mathlib Map

Theorems · Theorem · combinatorics

Matroid.IsRkFinite.isRkFinite_sdiff_iff

∀ {α : Type u_1} {M : Matroid α} {X Y : Set α}, M.IsRkFinite X → (M.IsRkFinite (Y \ X) ↔ M.IsRkFinite Y)
Defined in
Mathlib.Combinatorics.Matroid.Rank.Finite
Cited by
2 results in Mathlib
Foundations
Depth 110 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Matroid.IsRkFinite.sdiff_singleton_iff · cited by 1IsRkFinite.sdiff_singleto…Matroid.IsRkFinite.isRkFinite_diff_iff · cited by 0IsRkFinite.isRkFinite_dif…Set · cited by 53352SetMatroid · cited by 1258MatroidMatroid.IsRkFinite · cited by 53Matroid.IsRkFiniteSet.union_sdiff_self · cited by 28Set.union_sdiff_selfMatroid.IsRkFinite.isRkFinite_union_iff · cited by 2IsRkFinite.isRkFinite_uni…IsRkFinite.isRkFinite_sdiff_i…CITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.