Auction.ReserveSecondPrice.reserve_le_bid_winner_of_allocation_eq_some
theoremverifiedformalizationimported Lean
If the item is allocated, then the winning bid meets the reserve.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I : Type*} [Fintype I] [Nontrivial I] [DecidableEq I] in variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in omit [DecidableEq I] [AddCommGroup U] [IsOrderedAddMonoid U] in lemma Auction.ReserveSecondPrice.reserve_le_bid_winner_of_allocation_eq_some {reserve : U} {b : I → U} {i : I} (halloc : allocation reserve b = some i) : reserve ≤ b (SecondPrice.winner b)
- Formalizes
- EconCSLib, `Auction.ReserveSecondPrice.reserve_le_bid_winner_of_allocation_eq_some`
- 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.ReserveSecondPrice.reserve_le_bid_winner_of_allocation_eq_some← Auction.ReserveSecondPrice.reserve_le_bid_winner_of_allocation_eq_some (EconCSLib/MechanismDesign/Auction/ReserveVickrey.lean:112): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Auction.ReserveSecondPrice.allocationThe item is sold exactly when the winning bid meets the reserve.
- Auction.SecondPrice.winnerThe winner of the second-price auction: the bidder with the highest bid. Uses
Auction.argmaxBidfrom…
- Used by 1
- Auction.ReserveSecondPrice.clearingPrice_le_bid_of_allocation_eq_someWhen the item is sold, the clearing price is no more than the allocated bidder's 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] [DecidableEq I] invariable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] inomit [DecidableEq I] [AddCommGroup U] [IsOrderedAddMonoid U] in/-- If the item is allocated, then the winning bid meets the reserve. -/lemma Auction.ReserveSecondPrice.reserve_le_bid_winner_of_allocation_eq_some {reserve : U} {b : I → U} {i : I} (halloc : allocation reserve b = some i) : reserve ≤ b (SecondPrice.winner b) := by unfold allocation at halloc by_cases h : reserve ≤ b (SecondPrice.winner b) · exact h · simp [h] at halloc