Mathlib Map

Theorems · Theorem · order theory

Finset.sort_nodup

∀ {α : 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).Nodup
Defined in
Mathlib.Data.Finset.Sort
Cited by
4 results in Mathlib
Foundations
Depth 62 from the axioms · uses propext, Quot.sound
Assumes
DecidableRelIsTransStd.AntisymmStd.Total
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Finset.sortedLT_sort · cited by 1Finset.sortedLT_sortFinset.sort_toFinset · cited by 1Finset.sort_toFinsetFinset.sortedGT_sort · cited by 1Finset.sortedGT_sortEncodable.sortedUniv_nodup · cited by 1Encodable.sortedUniv_nodupFinset · cited by 13712FinsetMultiset · cited by 2627MultisetIsTrans · cited by 157IsTransMultiset.Nodup · cited by 148Multiset.NodupFinset.sort · cited by 42Finset.sortFinset.nodup · cited by 40Finset.nodupFinset.sort_eq · cited by 3Finset.sort_eqFinset.sort_nodupCITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by4

Results whose statement or proof uses this declaration.