AFTD Auto-Formalizing Theoretical Domains

Auction.ReserveSecondPrice.allocation_eq_some_iff

theoremverifiedformalizationimported Lean

The allocation is some i exactly when the reserve is met and 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.allocation_eq_some_iff {reserve : U} {b : I → U} {i : I} :
    allocation reserve b = some i ↔
      reserve ≤ b (SecondPrice.winner b) ∧ SecondPrice.winner b = i
Formalizes
EconCSLib, `Auction.ReserveSecondPrice.allocation_eq_some_iff`
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

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/-- The allocation is `some i` exactly when the reserve is met and `i` is the second-price winner. -/lemma Auction.ReserveSecondPrice.allocation_eq_some_iff {reserve : U} {b : I → U} {i : I} :    allocation reserve b = some i ↔      reserve ≤ b (SecondPrice.winner b) ∧ SecondPrice.winner b = i := by  unfold allocation  by_cases h : reserve ≤ b (SecondPrice.winner b)  · simp [h]  · simp [h]
See it in the graphDiscuss this resultChallenge it