Mathlib Map

Theorems · Theorem · order theory

Finset.sort_val

∀ {α : 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.val.sort r = s.sort r
Defined in
Mathlib.Data.Finset.Sort
Cited by
1 results in Mathlib
Foundations
Depth 61 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.sort_cons · cited by 2Finset.sort_consFinset · cited by 13712FinsetFinset.val · cited by 438Finset.valIsTrans · cited by 157IsTransFinset.sort · cited by 42Finset.sortMultiset.sort · cited by 19Multiset.sortFinset.sort_valCITED BYCITES

Cites5

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

Cited by1

Results whose statement or proof uses this declaration.