Theorems · Theorem · order theory

Function.argmin_le

∀ {α : Type u_1} {β : Type u_2} (f : α → β) [inst : LinearOrder β] [inst_1 : WellFoundedLT β] (a : α)
  [inst_2 : Nonempty α], f (Function.argmin f) ≤ f a

Defined in

Mathlib.Order.WellFounded

Cited by

2 results in Mathlib

Foundations

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

Assumes

LinearOrderWellFoundedLTNonempty