Theorems · Theorem · order theory

Function.isMinimalFor_argminOn

∀ {α : Type u_1} {β : Type u_2} (f : α → β) [inst : LinearOrder β] [inst_1 : WellFoundedLT β] (s : Set α)
  (hs : s.Nonempty), MinimalFor (fun x => x ∈ s) f (Function.argminOn f s hs)

Defined in

Mathlib.Order.WellFounded

Cited by

0 results in Mathlib

Foundations

Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LinearOrderWellFoundedLT