Auction.exists_maxBid
theoremverifiedformalizationimported Lean
There exists a bidder whose bid equals 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 lemma Auction.exists_maxBid : ∃ i : I, b i = maxBid b
- Formalizes
- EconCSLib, `Auction.exists_maxBid`
- 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.exists_maxBid← Auction.exists_maxBid (EconCSLib/MechanismDesign/Auction/AuctionBasic.lean:205): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Auction.maxBidThe highest bid in a profile.
- Used by 2
- 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.argmaxBid_eq_maxBidThe argmax bidder's bid equals the highest bid.
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) in/-- There exists a bidder whose bid equals the highest bid. -/lemma Auction.exists_maxBid : ∃ i : I, b i = maxBid b := by obtain ⟨i, _, h2⟩ := Finset.exists_mem_eq_sup' Finset.univ_nonempty b exact ⟨i, symm h2⟩