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.TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexing← TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexing (Physlib/Relativity/Tensors/Reindexing.lean:578): verbatim
- Verified
- 09 Oct 2026
- Axioms
Quot.sound- Built on 4
- TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexing.inv_perserve_colorTensorSpecies.Tensor.IsReindexing.inv_perserve_color
- TensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_colorTensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_color
- TensorSpecies.Tensor.IsReindexingGiven two lists of indices
c : Fin n → Candc1 : Fin m → Ca mapσ : Fin m → Fin nsatisfies the conditionIsReindexing c c1 σif…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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