SocialChoice.Voting.topKey_injective
theoremverifiedformalizationimported Lean
SocialChoice.Voting.topKey_injective
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in theorem SocialChoice.Voting.topKey_injective [Fintype A] (r : LinearOrder A) (y : A) : Function.Injective (topKey r y)
- Formalizes
- EconCSLib, `SocialChoice.Voting.topKey_injective`
- 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.topKey_injective← SocialChoice.Voting.topKey_injective (EconCSLib/SocialChoice/Voting/Decisive.lean:158): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.rank
rank r ais the number of alternatives strictly aboveain ballotr. - SocialChoice.Voting.topKeySocialChoice.Voting.topKey
- SocialChoice.Voting.rank_injectiveSocialChoice.Voting.rank_injective
- Used by 3
- SocialChoice.Voting.topBallot_topSocialChoice.Voting.topBallot_top
- SocialChoice.Voting.topBallot_preservesSocialChoice.Voting.topBallot_preserves
- SocialChoice.Voting.topBallotSocialChoice.Voting.topBallot
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.topKey_injective [Fintype A] (r : LinearOrder A) (y : A) : Function.Injective (topKey r y) := by classical intro a b h unfold topKey at h by_cases hay : a = y <;> by_cases hby : b = y · simp_all · simp_all · simp_all · simp_all exact rank_injective r (by omega)