AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.agent0_efx

theoremverifiedformalizationimported Lean

SocialChoice.FairDivision.Indivisible.agent0_efx

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N G : Type*} in
lemma SocialChoice.FairDivision.Indivisible.agent0_efx [DecidableEq G]
    (w : AdditiveValuation (Fin 2) G) (hnn₀ : ∀ g, 0 ≤ w.weight 0 g)
    (allGoods S_star : Finset G)
    (hfeas : w.toValuation.val 0 (allGoods \ S_star) ≤ w.toValuation.val 0 S_star)
    (g : G) :
    w.toValuation.val 0 ((allGoods \ S_star) \ {g}) ≤ w.toValuation.val 0 S_star
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.agent0_efx`
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 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset invariable {N G : Type*} inlemma SocialChoice.FairDivision.Indivisible.agent0_efx [DecidableEq G]    (w : AdditiveValuation (Fin 2) G) (hnn₀ : ∀ g, 0 ≤ w.weight 0 g)    (allGoods S_star : Finset G)    (hfeas : w.toValuation.val 0 (allGoods \ S_star) ≤ w.toValuation.val 0 S_star)    (g : G) :    w.toValuation.val 0 ((allGoods \ S_star) \ {g}) ≤ w.toValuation.val 0 S_star := by  exact le_trans ( Finset.sum_le_sum_of_subset_of_nonneg ( by aesop ) fun _ _ _ => hnn₀ _ ) hfeas
See it in the graphDiscuss this resultChallenge it