Theorems · Theorem · order theory
Finset.sortedGT_sort
∀ {α : Type u_1} [inst : LinearOrder α] (s : Finset α), (s.sort fun x1 x2 => x1 ≥ x2).SortedGT- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 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.
Cites8
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
- LinearOrderstatement and proof · cited by 8,572
- List.SortedGTstatement · cited by 54
- Finset.sortstatement · cited by 42
- Finset.pairwise_sortproof · cited by 5
- List.Pairwise.sortedGEproof · cited by 4
- Finset.sort_nodupproof · cited by 4
- List.SortedGE.sortedGT_of_nodupproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Profinite.NobelingProof.GoodProducts.spanFinproof · cited by 1