AFTD Auto-Formalizing Theoretical Domains

Physlib.Fin.involutionNoFixed_card_succ

theoremverifiedformalizationimported Lean

Physlib.Fin.involutionNoFixed_card_succ

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Nat in
lemma Physlib.Fin.involutionNoFixed_card_succ {n : ℕ} :
    Fintype.card
    {f : Fin n.succ.succ → Fin n.succ.succ // Function.Involutive f ∧ (∀ i, f i ≠ i)}
    = n.succ *
    Fintype.card {f : Fin n → Fin n // Function.Involutive f ∧ (∀ i, f i ≠ i)}
Formalizes
Physlib, `Physlib.Fin.involutionNoFixed_card_succ`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Nat inlemma Physlib.Fin.involutionNoFixed_card_succ {n : ℕ} :    Fintype.card    {f : Fin n.succ.succ → Fin n.succ.succ // Function.Involutive f ∧ (∀ i, f i ≠ i)}    = n.succ *    Fintype.card {f : Fin n → Fin n // Function.Involutive f ∧ (∀ i, f i ≠ i)} := by  simp [Fintype.card_congr involutionNoFixedZeroEquivProd]
See it in the graphDiscuss this resultChallenge it