AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.relabelBallotEquiv

defimported Lean

Relabel a linear order along an equivalence of alternative types.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N A : Type*} in
noncomputable def SocialChoice.Voting.relabelBallotEquiv {B : Type*} (r : LinearOrder A) (e : A ≃ B) :
    LinearOrder B
Defined in
EconCSLib, `SocialChoice.Voting.relabelBallotEquiv`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N A : Type*} in
/-- Relabel a linear order along an equivalence of alternative types. -/
noncomputable def SocialChoice.Voting.relabelBallotEquiv {B : Type*} (r : LinearOrder A) (e : A ≃ B) :
    LinearOrder B := by
  classical
  exact ballotFromInjective r e.symm e.symm.injective
See it in the graphDiscuss this resultChallenge it