AFTD Auto-Formalizing Theoretical Domains

Auction.BidProfile.inBox_iff_inSet_Icc

theoremverifiedformalizationimported Lean

InBox b ℓ u is equivalent to InSet b (fun i => Set.Icc (ℓ i) (u i)). Makes box-constrained bid spaces interoperable with the Mathlib Set.Icc API (continuity, compactness, integration).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I V : Type*} in
lemma Auction.BidProfile.inBox_iff_inSet_Icc [Preorder V] (b : I → V) (ℓ u : I → V) :
    InBox b ℓ u ↔ InSet b (fun i => Set.Icc (ℓ i) (u i))
Formalizes
EconCSLib, `Auction.BidProfile.inBox_iff_inSet_Icc`
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
Quot.soundpropext
Built on 2
  • Auction.BidProfile.InBoxEach bid lies in the per-agent box $[\ell_i, u_i]$. $\forall i.\; \ell_i \le b_i \le u_i$.
  • Auction.BidProfile.InSetEach bid lies in the per-agent admissible set. For a family of strategy sets $S_i \subseteq V$, asserts $\forall i.\; b_i \in S_i$.…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {I V : Type*} in/-- `InBox b ℓ u` is equivalent to `InSet b (fun i => Set.Icc (ℓ i) (u i))`. Makes box-constrained bid spaces interoperable with the Mathlib `Set.Icc` API (continuity, compactness, integration). -/lemma Auction.BidProfile.inBox_iff_inSet_Icc [Preorder V] (b : I → V) (ℓ u : I → V) :    InBox b ℓ u ↔ InSet b (fun i => Set.Icc (ℓ i) (u i)) := by  unfold InBox InSet  simp [Set.mem_Icc]
See it in the graphDiscuss this resultChallenge it