AFTD Auto-Formalizing Theoretical Domains

Physlib.Fin.involutionAddEquiv_cast

theoremverifiedformalizationimported Lean

Physlib.Fin.involutionAddEquiv_cast

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Nat in
lemma Physlib.Fin.involutionAddEquiv_cast {n : ℕ} {f1 f2 : {f : Fin n → Fin n // Function.Involutive f}}
    (hf : f1 = f2) :
    involutionAddEquiv f1 = (Equiv.subtypeEquivRight (by rw [hf]; simp)).trans
      ((involutionAddEquiv f2).trans (Equiv.optionCongr (finCongr (by rw [hf]))))
Formalizes
Physlib, `Physlib.Fin.involutionAddEquiv_cast`
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 1
  • Physlib.Fin.involutionAddEquivGiven an involution of Fin n, the optional choice of an element in Fin n which maps to itself is equivalent to the optional choice of…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Nat inlemma Physlib.Fin.involutionAddEquiv_cast {n : ℕ} {f1 f2 : {f : Fin n → Fin n // Function.Involutive f}}    (hf : f1 = f2) :    involutionAddEquiv f1 = (Equiv.subtypeEquivRight (by rw [hf]; simp)).trans      ((involutionAddEquiv f2).trans (Equiv.optionCongr (finCongr (by rw [hf])))) := by  subst hf  rw [finCongr_refl, Equiv.optionCongr_refl]  rfl
See it in the graphDiscuss this resultChallenge it