AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.natBinaryLoad_update_true_of_false

theoremverifiedformalizationimported Lean

KnapsackAuction.natBinaryLoad_update_true_of_false

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
variable {I : Type*} [Fintype I] [DecidableEq I] in
lemma KnapsackAuction.natBinaryLoad_update_true_of_false
    (w : I → Nat) {x : BinaryAllocation I} {i : I}
    (hxi : x i = false) :
    natBinaryLoad w (Function.update x i true) =
      w i + natBinaryLoad w x
Formalizes
EconCSLib, `KnapsackAuction.natBinaryLoad_update_true_of_false`
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 inopen scoped BigOperators invariable {I : Type*} [Fintype I] [DecidableEq I] inlemma KnapsackAuction.natBinaryLoad_update_true_of_false    (w : I → Nat) {x : BinaryAllocation I} {i : I}    (hxi : x i = false) :    natBinaryLoad w (Function.update x i true) =      w i + natBinaryLoad w x := by  have htail :      natBinaryLoad w x =        Finset.sum (Finset.univ.erase i) (fun j => if Function.update x i true j = true then w j else 0) := by    rw [natBinaryLoad, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)]    have hs :        Finset.sum (Finset.univ.erase i) (fun j => if x j = true then w j else 0) =          Finset.sum (Finset.univ.erase i) (fun j => if Function.update x i true j = true then w j else 0) := by      refine Finset.sum_congr rfl ?_      intro j hj      have hji : j ≠ i := by simpa using hj      simp [Function.update, hji]    simpa [hxi] using hs  rw [natBinaryLoad, ← Finset.add_sum_erase Finset.univ _ (Finset.mem_univ i)]  rw [htail]  simp [Function.update]
See it in the graphDiscuss this resultChallenge it