Auction.maxBidExcluding_eq_maxBid_of_not_argmax
theoremverifiedformalizationimported Lean
If i is not the argmax bidder, excluding i does not change the highest bid.
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_eq_maxBid_of_not_argmax {i : I} (h : i ≠ argmaxBid b) : maxBidExcluding b i = maxBid b
- Formalizes
- EconCSLib, `Auction.maxBidExcluding_eq_maxBid_of_not_argmax`
- 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.Auction.maxBidExcluding_eq_maxBid_of_not_argmax← Auction.maxBidExcluding_eq_maxBid_of_not_argmax (EconCSLib/MechanismDesign/Auction/AuctionBasic.lean:242): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- Auction.argmaxBidThe bidder whose bid achieves the maximum. This is a mathematical argmax, not a declaration that any auction's winner is the highest…
- Auction.maxBidExcluding_le_maxBidExcluding any bidder can only decrease the highest bid.
- Auction.maxBidExcludingThe highest bid excluding bidder
i. - Auction.argmaxBid_eq_maxBidThe argmax bidder's bid equals the highest bid.
- Auction.maxBidThe highest bid in a profile.
- Used by 2
- Auction.SecondPrice.maxBidExcluding_eq_maxBid_if_loserAuction.SecondPrice.maxBidExcluding_eq_maxBid_if_loser
- Auction.ReserveSecondPrice.bid_le_clearing_threshold_of_not_allocation_update_selfAuction.ReserveSecondPrice.bid_le_clearing_threshold_of_not_allocation_update_self
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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/-- If `i` is not the argmax bidder, excluding `i` does not change the highest bid. -/lemma Auction.maxBidExcluding_eq_maxBid_of_not_argmax {i : I} (h : i ≠ argmaxBid b) : maxBidExcluding b i = maxBid b := by apply le_antisymm · exact maxBidExcluding_le_maxBid b i · rw [← argmaxBid_eq_maxBid b] exact Finset.le_sup' b (Finset.mem_erase_of_ne_of_mem h.symm (Finset.mem_univ _))