Theorems · Theorem · order theory
Finset.sort_eq
∀ {α : 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) = s.val- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 3 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.
Cites7
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
- Multisetstatement · cited by 2,627
- Finset.valstatement and proof · cited by 438
- Multiset.ofListstatement · cited by 290
- IsTransstatement and proof · cited by 157
- Finset.sortstatement · cited by 42
- Multiset.sort_eqproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- Finset.sort_nodupproof · cited by 4
- Finset.sort_perm_toListproof · cited by 1
- Finset.sort_toFinsetproof · cited by 1