SocialChoice.Voting.rank_lt_of_lt
theoremverifiedformalizationimported Lean
SocialChoice.Voting.rank_lt_of_lt
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.rank_lt_of_lt [Fintype A] (r : LinearOrder A) {a b : A} (hab : BallotPrefers r a b) : rank r a < rank r b
- Formalizes
- EconCSLib, `SocialChoice.Voting.rank_lt_of_lt`
- 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.rank_lt_of_lt← SocialChoice.Voting.rank_lt_of_lt (EconCSLib/SocialChoice/Voting/VotingRules.lean:76): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- SocialChoice.Voting.BallotPrefersBallot
rranksastrictly aboveb. - SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - SocialChoice.Voting.rank
rank r ais the number of alternatives strictly aboveain ballotr.
- SocialChoice.Voting.BallotPrefersBallot
- Used by 2
- SocialChoice.Voting.rank_lt_iffSocialChoice.Voting.rank_lt_iff
- SocialChoice.Voting.rank_injectiveSocialChoice.Voting.rank_injective
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 inopen Classical inopen Finset inopen scoped BigOperators invariable {N A : Type*} intheorem SocialChoice.Voting.rank_lt_of_lt [Fintype A] (r : LinearOrder A) {a b : A} (hab : BallotPrefers r a b) : rank r a < rank r b := by classical letI := r change a < b at hab have hsubset : (Finset.univ.filter (fun x : A => BallotPrefers r x a)) ⊆ (Finset.univ.filter (fun x : A => BallotPrefers r x b)) := by intro x hx exact Finset.mem_filter.mpr ⟨by simp, by change x < b exact lt_trans (by simpa [BallotPrefers] using (Finset.mem_filter.mp hx).2) hab⟩ have hssub : (Finset.univ.filter (fun x : A => BallotPrefers r x a)) ⊂ (Finset.univ.filter (fun x : A => BallotPrefers r x b)) := by refine (Finset.ssubset_iff_of_subset hsubset).2 ?_ refine ⟨a, ?_, ?_⟩ · exact Finset.mem_filter.mpr ⟨by simp, by simpa [BallotPrefers] using hab⟩ · intro ha exact lt_irrefl a (by simpa [BallotPrefers] using (Finset.mem_filter.mp ha).2) simpa [rank] using Finset.card_lt_card hssub