AFTD Auto-Formalizing Theoretical Domains

Auction.ReserveSecondPrice.winner_eq_of_allocation_eq_some

theoremverifiedformalizationimported Lean

If bidder i is allocated the item, then i is the second-price winner.

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.winner_eq_of_allocation_eq_some {reserve : U} {b : I → U} {i : I}
    (halloc : allocation reserve b = some i) :
    SecondPrice.winner b = i
Formalizes
EconCSLib, `Auction.ReserveSecondPrice.winner_eq_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 2

Lean source view module on GitHub

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 bidder `i` is allocated the item, then `i` is the second-price winner. -/lemma Auction.ReserveSecondPrice.winner_eq_of_allocation_eq_some {reserve : U} {b : I → U} {i : I}    (halloc : allocation reserve b = some i) :    SecondPrice.winner b = i := by  unfold allocation at halloc  by_cases h : reserve ≤ b (SecondPrice.winner b)  · simpa [h] using halloc  · simp [h] at halloc
See it in the graphDiscuss this resultChallenge it