Theorems · Theorem · order theory
Finset.mem_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] {a : α}, a ∈ s.sort r ↔ a ∈ s- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- IsTransstatement and proof · cited by 157
- Finset.sortstatement · cited by 42
- Multiset.mem_sortproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Finset.sorted_zero_eq_min'_auxproof · cited by 2
- Finset.sorted_last_eq_max'_auxproof · cited by 2
- Encodable.mem_sortedUnivproof · cited by 1