Theorems · Theorem · combinatorics
Finset.Colex.isInitSeg_initSeg
∀ {α : Type u_1} [inst : LinearOrder α] {s : Finset α} [inst_1 : Fintype α],
Finset.Colex.IsInitSeg (Finset.Colex.initSeg s) s.card- Defined in
- Mathlib.Combinatorics.Colex
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- Fintypestatement and proof · cited by 7,736
- LE.le.transproof · cited by 3,151
- Finset.cardstatement and proof · cited by 2,327
- LT.lt.leproof · cited by 2,189
- toColexproof · cited by 90
- Finset.Colex.IsInitSegstatement · cited by 9
- Finset.Colex.initSegstatement and proof · cited by 8
- Finset.Colex.mem_initSegproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Finset.Colex.IsInitSeg.shadowproof · cited by 1
- Finset.Colex.isInitSeg_iff_exists_initSegproof · cited by 0