Theorems · Definition · combinatorics
Finset.Colex.IsInitSeg
{α : Type u_1} → [LinearOrder α] → Finset (Finset α) → ℕ → Prop𝒜 is an initial segment of the colexicographic order on sets of r, and that if t is below
s in colex where t has size r and s is in 𝒜, then t is also in 𝒜. In effect, 𝒜 is
downwards closed with respect to colex among sets of size r.
- Defined in
- Mathlib.Combinatorics.Colex
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- LinearOrderstatement and proof · cited by 8,572
- SetLike.coeproof · cited by 8,199
- Finset.cardproof · cited by 2,327
- toColexproof · cited by 90
- Set.Sizedproof · cited by 35
Cited by9
Results whose statement or proof uses this declaration.
- Finset.Colex.IsInitSeg.exists_initSegstatement and proof · cited by 2
- Finset.Colex.isInitSeg_initSegstatement · cited by 2
- Finset.Colex.IsInitSeg.shadowstatement and proof · cited by 1
- Finset.Colex.IsInitSeg.totalstatement and proof · cited by 1
- Finset.iterated_kkstatement and proof · cited by 1
- Finset.kruskal_katonastatement and proof · cited by 1
- Finset.UV.isInitSeg_of_compressedstatement · cited by 1
- Finset.Colex.isInitSeg_emptystatement · cited by 0
- Finset.Colex.isInitSeg_iff_exists_initSegstatement and proof · cited by 0