AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.lam.aux.le_lam0

theoremverifiedformalizationimported Lean

The supremum lam0 dominates every lam.aux value.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
theorem MinimaxLoomis.lam.aux.le_lam0 (A : I → J → ℝ) (x : stdSimplex ℝ I) :
    lam.aux A x ≤ lam0 A
Formalizes
EconCSLib, `MinimaxLoomis.lam.aux.le_lam0`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- The supremum `lam0` dominates every `lam.aux` value. -/theorem MinimaxLoomis.lam.aux.le_lam0 (A : I → J → ℝ) (x : stdSimplex ℝ I) :    lam.aux A x ≤ lam0 A :=  le_ciSup (bddAbove_def.2 (by    obtain ⟨C, hC⟩ := lam.aux.bddAbove A    exact ⟨C, by rintro r ⟨x, rfl⟩; exact hC x⟩)) x
See it in the graphDiscuss this resultChallenge it