SocialChoice.Voting.topBallot_preserves
theoremverifiedformalizationimported Lean
SocialChoice.Voting.topBallot_preserves
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in theorem SocialChoice.Voting.topBallot_preserves [Fintype A] (r : LinearOrder A) {y a b : A} (ha : a ≠ y) (hb : b ≠ y) : BallotPrefers (topBallot r y) a b ↔ BallotPrefers r a b
- Formalizes
- EconCSLib, `SocialChoice.Voting.topBallot_preserves`
- 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.topBallot_preserves← SocialChoice.Voting.topBallot_preserves (EconCSLib/SocialChoice/Voting/Decisive.lean:179): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- SocialChoice.Voting.BallotPrefersBallot
rranksastrictly aboveb. - SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.rank_lt_iffSocialChoice.Voting.rank_lt_iff
- SocialChoice.Voting.ballotFromInjectivePull a linear order back along an injective map, using the supplied codomain order explicitly rather than relying on ambient typeclass…
- SocialChoice.Voting.rank
rank r ais the number of alternatives strictly aboveain ballotr. - SocialChoice.Voting.topKeySocialChoice.Voting.topKey
- SocialChoice.Voting.ballotLTBallot
r's strict-order instance, exposed explicitly to avoid ambient typeclass search. - SocialChoice.Voting.topBallotSocialChoice.Voting.topBallot
- SocialChoice.Voting.topKey_injectiveSocialChoice.Voting.topKey_injective
- SocialChoice.Voting.BallotPrefersBallot
- Used by 1
- SocialChoice.Voting.modifiedForwardProfile_specSocialChoice.Voting.modifiedForwardProfile_spec
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.topBallot_preserves [Fintype A] (r : LinearOrder A) {y a b : A} (ha : a ≠ y) (hb : b ≠ y) : BallotPrefers (topBallot r y) a b ↔ BallotPrefers r a b := by simp [topBallot, topKey, ha, hb, rank_lt_iff]