AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.supportedOn

defimported Lean

An allocation is supported on a list of agents if every selected agent appears in that list.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] in
def KnapsackAuction.supportedOn (items : List I) (x : BinaryAllocation I) : Prop
Defined in
EconCSLib, `KnapsackAuction.supportedOn`
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
none listed
Built on 1
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] in
/-- An allocation is supported on a list of agents if every selected agent appears in that list. -/
def KnapsackAuction.supportedOn (items : List I) (x : BinaryAllocation I) : Prop :=
  ∀ i, x i = true → i ∈ items
See it in the graphDiscuss this resultChallenge it