AFTD Auto-Formalizing Theoretical Domains

Auction.maxBidExcluding_le_argmaxBid_bid

theoremverifiedformalizationimported Lean

The argmax bidder's bid is at least the highest bid among all others.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [Fintype I] [Nontrivial I] {V : Type*} [LinearOrder V] in
variable (b : I → V) in
variable [DecidableEq I] in
lemma Auction.maxBidExcluding_le_argmaxBid_bid :
    maxBidExcluding b (argmaxBid b) ≤ b (argmaxBid b)
Formalizes
EconCSLib, `Auction.maxBidExcluding_le_argmaxBid_bid`
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 invariable {I : Type*} [Fintype I] [Nontrivial I] {V : Type*} [LinearOrder V] invariable (b : I → V) invariable [DecidableEq I] in/-- The argmax bidder's bid is at least the highest bid among all others. -/lemma Auction.maxBidExcluding_le_argmaxBid_bid :    maxBidExcluding b (argmaxBid b) ≤ b (argmaxBid b) := by  calc maxBidExcluding b (argmaxBid b)      ≤ maxBid b := maxBidExcluding_le_maxBid b (argmaxBid b)    _ = b (argmaxBid b) := (argmaxBid_eq_maxBid b).symm
See it in the graphDiscuss this resultChallenge it