SocialChoice.Voting.exists_three_distinct_of_card_ge_three
theoremverifiedformalizationimported Lean
A finite alternative set with at least three elements contains three distinct alternatives. This local helper packages the cardinality assumption into the witness shape used by the decisive-coalitions proof of Arrow's theorem.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in theorem SocialChoice.Voting.exists_three_distinct_of_card_ge_three {A : Type*} [Fintype A] (hA : Fintype.card A ≥ 3) : ∃ x y z : A, x ≠ y ∧ x ≠ z ∧ y ≠ z
- Formalizes
- EconCSLib, `SocialChoice.Voting.exists_three_distinct_of_card_ge_three`
- 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.exists_three_distinct_of_card_ge_three← SocialChoice.Voting.exists_three_distinct_of_card_ge_three (EconCSLib/SocialChoice/Voting/Arrow.lean:42): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
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*} in/-- A finite alternative set with at least three elements contains three distinct alternatives. This local helper packages the cardinality assumption into the witness shape used by the decisive-coalitions proof of Arrow's theorem. -/theorem SocialChoice.Voting.exists_three_distinct_of_card_ge_three {A : Type*} [Fintype A] (hA : Fintype.card A ≥ 3) : ∃ x y z : A, x ≠ y ∧ x ≠ z ∧ y ≠ z := by classical let e := Fintype.equivFin A refine ⟨e.symm ⟨0, ?_⟩, e.symm ⟨1, ?_⟩, e.symm ⟨2, ?_⟩, ?_, ?_, ?_⟩ · exact lt_of_lt_of_le (by decide : 0 < 3) hA · exact lt_of_lt_of_le (by decide : 1 < 3) hA · exact lt_of_lt_of_le (by decide : 2 < 3) hA · intro h have := congrArg e h simp at this · intro h have := congrArg e h simp at this · intro h have := congrArg e h simp at this