AFTD Auto-Formalizing Theoretical Domains

Auction.maxBidExcluding_update_self

theoremverifiedformalizationimported Lean

Changing i's bid does not affect the highest bid among the others.

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_update_self (i : I) (bi : V) :
    maxBidExcluding (Function.update b i bi) i = maxBidExcluding b i
Formalizes
EconCSLib, `Auction.maxBidExcluding_update_self`
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 1
Used by 3

Lean source view module on GitHub

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/-- Changing `i`'s bid does not affect the highest bid among the others. -/lemma Auction.maxBidExcluding_update_self (i : I) (bi : V) :    maxBidExcluding (Function.update b i bi) i = maxBidExcluding b i := by  apply Finset.sup'_congr _ rfl  intro j hj  simp [Function.update_of_ne (Finset.ne_of_mem_erase hj)]
See it in the graphDiscuss this resultChallenge it