TensorSpecies.Tensor.IsReindexing.append_congr_left
theoremverifiedformalizationimported Lean
TensorSpecies.Tensor.IsReindexing.append_congr_left
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.append_congr_left {n n' n2 : ℕ} {c : Fin n → C} {c' : Fin n' → C} {σ : Fin n' → Fin n} (c2 : Fin n2 → C) (h : IsReindexing c c' σ) : IsReindexing (Fin.append c c2) (Fin.append c' c2) (Fin.append (Fin.castAdd n2 ∘ σ) (Fin.natAdd n))
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.append_congr_left`
- 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.append_congr_left← TensorSpecies.Tensor.IsReindexing.append_congr_left (Physlib/Relativity/Tensors/Reindexing.lean:219): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- 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 inlemma TensorSpecies.Tensor.IsReindexing.append_congr_left {n n' n2 : ℕ} {c : Fin n → C} {c' : Fin n' → C} {σ : Fin n' → Fin n} (c2 : Fin n2 → C) (h : IsReindexing c c' σ) : IsReindexing (Fin.append c c2) (Fin.append c' c2) (Fin.append (Fin.castAdd n2 ∘ σ) (Fin.natAdd n)) := by refine ⟨?_, fun i => ?_⟩ · have heq : (Fin.append (Fin.castAdd n2 ∘ σ) (Fin.natAdd n) : Fin (n' + n2) → Fin (n + n2)) = ⇑(finSumFinEquiv.symm.trans (((Equiv.ofBijective σ h.1).sumCongr (Equiv.refl (Fin n2))).trans finSumFinEquiv)) := by ext i refine Fin.addCases (fun a => ?_) (fun a => ?_) i <;> simp [Fin.append_left, Fin.append_right] rw [heq] exact Equiv.bijective _ · refine Fin.addCases (fun a => ?_) (fun a => ?_) i <;> simp [Fin.append_left, Fin.append_right, h.2]