AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.scoringRule_isTotal

theoremverifiedformalizationimported Lean

SocialChoice.Voting.scoringRule_isTotal

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.scoringRule_isTotal (score : Nat → Nat → Int)
    [Fintype N] [Fintype A] [Nonempty A] :
    IsTotal (N := N) (A := A) (scoringRule score)
Formalizes
EconCSLib, `SocialChoice.Voting.scoringRule_isTotal`
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 5
Used by 3

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.scoringRule_isTotal (score : Nat → Nat → Int)    [Fintype N] [Fintype A] [Nonempty A] :    IsTotal (N := N) (A := A) (scoringRule score) := by  intro P  simpa [scoringRule] using scoringWinners_nonempty (P := P)    (score := fun r => score (Fintype.card A) r)
See it in the graphDiscuss this resultChallenge it