AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexing

theoremverifiedformalizationimported Lean

Casting the domain along an equality n1 = n of lengths is a reindexing of c by c ∘ Fin.cast h.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor in
open Module in
variable {C : Type} in
open Fin in
lemma TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexing (n n1 : ℕ) {c : Fin n → C} (h : n1 = n) :
    IsReindexing c (c ∘ Fin.cast h) (Fin.cast h)
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexing`
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
09 Oct 2026
Axioms
Quot.sound
Built on 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen TensorSpecies TensorSpecies.Tensor inopen Module invariable {C : Type} inopen Fin in/-- Casting the domain along an equality `n1 = n` of lengths is a reindexing of `c` by `c ∘ Fin.cast h`. -/lemma TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexing (n n1 : ℕ) {c : Fin n → C} (h : n1 = n) :    IsReindexing c (c ∘ Fin.cast h) (Fin.cast h) := by  apply And.intro  · exact Equiv.bijective (finCongr h)  · intro i    rfl
See it in the graphDiscuss this resultChallenge it