AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.le_highestBidValue

theoremverifiedformalizationimported Lean

KnapsackAuction.le_highestBidValue

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in
omit [DecidableEq I] [LinearOrder I] in
lemma KnapsackAuction.le_highestBidValue (b : I → Nat) (i : I) :
    b i ≤ highestBidValue b
Formalizes
EconCSLib, `KnapsackAuction.le_highestBidValue`
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 1
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators invariable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] inomit [DecidableEq I] [LinearOrder I] inlemma KnapsackAuction.le_highestBidValue (b : I → Nat) (i : I) :    b i ≤ highestBidValue b := by  classical  exact Finset.le_sup' (s := Finset.univ) (f := b) (by simp)
See it in the graphDiscuss this resultChallenge it