SocialChoice.Voting.position_eq_rank_succ
theoremverifiedformalizationimported Lean
SocialChoice.Voting.position_eq_rank_succ
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.position_eq_rank_succ [Fintype A] (r : LinearOrder A) (a : A) : position r a = rank r a + 1
- Formalizes
- EconCSLib, `SocialChoice.Voting.position_eq_rank_succ`
- 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.position_eq_rank_succ← SocialChoice.Voting.position_eq_rank_succ (EconCSLib/SocialChoice/Voting/VotingRules.lean:54): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.positionThe 1-based position of
ain ballotr. - SocialChoice.Voting.rank
rank r ais the number of alternatives strictly aboveain ballotr.
Lean source view module on GitHub
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.position_eq_rank_succ [Fintype A] (r : LinearOrder A) (a : A) : position r a = rank r a + 1 := rfl