AFTD Auto-Formalizing Theoretical Domains

Auction.ReserveSecondPrice.mechanism_payment_eq_zero_of_allocation_eq_none

theoremverifiedformalizationimported Lean

If the item is withheld, every bidder pays zero.

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
variable {reserve : U} {v : I → U} in
omit [IsOrderedAddMonoid U] in
lemma Auction.ReserveSecondPrice.mechanism_payment_eq_zero_of_allocation_eq_none {reserve : U} {b : I → U} {i : I}
    (halloc : allocation reserve b = none) :
    (mechanism reserve).paymentRule b i = 0
Formalizes
EconCSLib, `Auction.ReserveSecondPrice.mechanism_payment_eq_zero_of_allocation_eq_none`
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 6

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] invariable {reserve : U} {v : I → U} inomit [IsOrderedAddMonoid U] in/-- If the item is withheld, every bidder pays zero. -/lemma Auction.ReserveSecondPrice.mechanism_payment_eq_zero_of_allocation_eq_none {reserve : U} {b : I → U} {i : I}    (halloc : allocation reserve b = none) :    (mechanism reserve).paymentRule b i = 0 := by  exact mechanism_payment_of_allocation_ne_some (by intro h; simp [halloc] at h)
See it in the graphDiscuss this resultChallenge it