AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity

theoremverifiedformalizationimported Lean

KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open KnapsackAuction in
open scoped BigOperators in
variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in
variable [Fintype I] [DecidableEq I] [LinearOrder I] in
omit [DecidableEq I] [LinearOrder I] in
lemma KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity
    (A : KnapsackAuction I U) {x : BinaryAllocation I}
    (hx : A.binaryRespectsCapacity x) :
    A.fractionalFeasible (binaryToAllocation x)
Formalizes
EconCSLib, `KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity`
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 8
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen KnapsackAuction inopen scoped BigOperators invariable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] invariable [Fintype I] [DecidableEq I] [LinearOrder I] inomit [DecidableEq I] [LinearOrder I] inlemma KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity    (A : KnapsackAuction I U) {x : BinaryAllocation I}    (hx : A.binaryRespectsCapacity x) :    A.fractionalFeasible (binaryToAllocation x) := by  constructor  · intro i    by_cases hxi : x i <;> simp [binaryToAllocation, hxi]  · simpa [binaryRespectsCapacity, binaryLoad, binaryToAllocation] using hx
See it in the graphDiscuss this resultChallenge it