Auction.BidProfile.InSet
defimported Lean
Each 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$. Captures heterogeneous strategy spaces.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I V : Type*} in def Auction.BidProfile.InSet (b : I → V) (S : I → Set V) : Prop
- Defined in
- EconCSLib, `Auction.BidProfile.InSet`
- 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.Auction.BidProfile.InSet← Auction.BidProfile.InSet (EconCSLib/MechanismDesign/Auction/AuctionBasic.lean:157): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 1
- Auction.BidProfile.inBox_iff_inSet_Icc
InBox b ℓ uis equivalent toInSet b (fun i => Set.Icc (ℓ i) (u i)). Makes box-constrained bid spaces interoperable with the Mathlib…
- Auction.BidProfile.inBox_iff_inSet_Icc
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I V : Type*} in /-- Each 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$. Captures heterogeneous strategy spaces. -/ def Auction.BidProfile.InSet (b : I → V) (S : I → Set V) : Prop := ∀ i, b i ∈ S i