AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.inv_cast_eq

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.inv_cast_eq

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor TensorSpecies.Tensor.IsReindexing in
open Module in
variable {C : Type} in
lemma TensorSpecies.Tensor.IsReindexing.inv_cast_eq {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C} (e : m = n)
    (h : IsReindexing c c1 (Fin.cast e)) (x : Fin n) :
    h.inv (Fin.cast e) x = Fin.cast e.symm x
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.inv_cast_eq`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 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
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen TensorSpecies TensorSpecies.Tensor TensorSpecies.Tensor.IsReindexing inopen Module invariable {C : Type} inlemma TensorSpecies.Tensor.IsReindexing.inv_cast_eq {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C} (e : m = n)    (h : IsReindexing c c1 (Fin.cast e)) (x : Fin n) :    h.inv (Fin.cast e) x = Fin.cast e.symm x := by  have hx := h.inv_apply_apply (Fin.cast e) x  have hval : (h.inv (Fin.cast e) x).val = x.val := congrArg Fin.val hx  exact Fin.val_inj.mp hval
See it in the graphDiscuss this resultChallenge it