SocialChoice.Voting.unanimity_univ_isDecisive
theoremverifiedformalizationimported Lean
SocialChoice.Voting.unanimity_univ_isDecisive
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in theorem SocialChoice.Voting.unanimity_univ_isDecisive [Fintype N] [Fintype A] {F : SWF N A} (h : SWF.Unanimity F) : IsDecisive F Set.univ
- Formalizes
- EconCSLib, `SocialChoice.Voting.unanimity_univ_isDecisive`
- 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.SocialChoice.Voting.unanimity_univ_isDecisive← SocialChoice.Voting.unanimity_univ_isDecisive (EconCSLib/SocialChoice/Voting/Decisive.lean:51): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.PrefersVoter
istrictly prefersatobin profileP. - SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
- instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
- SocialChoice.Voting.SWF.UnanimityUnanimity/Pareto for SWFs: unanimous strict preference forces social strict preference.
- SocialChoice.Voting.SWFA social welfare function maps strict profiles to a weak social preference.
- SocialChoice.Voting.IsDecisiveA coalition is decisive if it is decisive for every ordered pair of alternatives.
- Used by 1
- SocialChoice.Voting.exists_minimal_decisive_coalitionSocialChoice.Voting.exists_minimal_decisive_coalition
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N A : Type*} intheorem SocialChoice.Voting.unanimity_univ_isDecisive [Fintype N] [Fintype A] {F : SWF N A} (h : SWF.Unanimity F) : IsDecisive F Set.univ := by intro a b P hP exact h P a b (fun i => hP i (by simp))