AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.permuteWinners

defimported Lean

Candidate renaming on winner sets.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N A : Type*} in
variable [Fintype N] [Fintype A] in
noncomputable def SocialChoice.Voting.permuteWinners (σ : Equiv.Perm A) (s : Finset A) : Finset A
Defined in
EconCSLib, `SocialChoice.Voting.permuteWinners`
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
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
variable [Fintype N] [Fintype A] in
/-- Candidate renaming on winner sets. -/
noncomputable def SocialChoice.Voting.permuteWinners (σ : Equiv.Perm A) (s : Finset A) : Finset A := by
  classical
  exact s.map σ.toEmbedding
See it in the graphDiscuss this resultChallenge it