AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.scoringWinners_nonempty

theoremverifiedformalizationimported Lean

SocialChoice.Voting.scoringWinners_nonempty

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
open Finset in
open scoped BigOperators in
variable {N A : Type*} in
theorem SocialChoice.Voting.scoringWinners_nonempty [Fintype N] [Fintype A] [Nonempty A]
    (P : Profile N A) (score : Nat → Int) :
    (scoringWinners P score).Nonempty
Formalizes
EconCSLib, `SocialChoice.Voting.scoringWinners_nonempty`
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 4
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Classical inopen Finset inopen scoped BigOperators invariable {N A : Type*} intheorem SocialChoice.Voting.scoringWinners_nonempty [Fintype N] [Fintype A] [Nonempty A]    (P : Profile N A) (score : Nat → Int) :    (scoringWinners P score).Nonempty := by  classical  have hA : (Finset.univ : Finset A).Nonempty := Finset.univ_nonempty  let scoreSet : Finset Int := Finset.univ.image (fun a => scoreCandidate P score a)  have hScore : scoreSet.Nonempty := hA.image _  let maxScore : Int := scoreSet.max' hScore  have hmem : maxScore ∈ scoreSet := Finset.max'_mem scoreSet hScore  rcases Finset.mem_image.mp hmem with ⟨a, _, ha⟩  refine ⟨a, ?_⟩  simp [scoringWinners, hA, scoreSet, maxScore, ha]
See it in the graphDiscuss this resultChallenge it