Theorems · Theorem · order theory
Finset.length_sort
∀ {α : Type u_1} {s : Finset α} (r : α → α → Prop) [inst : DecidableRel r] [inst_1 : IsTrans α r]
[inst_2 : Std.Antisymm r] [inst_3 : Std.Total r], (s.sort r).length = s.card- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Quot.sound
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.
- Finsetstatement and proof · cited by 13,712
- Finset.cardstatement · cited by 2,327
- IsTransstatement and proof · cited by 157
- Finset.sortstatement · cited by 42
- Multiset.length_sortproof · cited by 2
Cited by6
Results whose statement or proof uses this declaration.
- Nat.nth_of_card_leproof · cited by 4
- Finset.orderEmbOfFin_lastproof · cited by 3
- Finset.max'_eq_sorted_lastproof · cited by 1
- Nat.nth_le_of_strictMonoOn_of_mapsToproof · cited by 1
- Finset.listMap_orderEmbOfFin_finRangeproof · cited by 0
- Encodable.length_sortedUnivproof · cited by 0