TensorSpecies.Tensor.IsReindexing.append_succ_last
theoremverifiedformalizationimported Lean
Splitting a list of colours c : Fin (n + 1) → C into its first n entries and its last entry recovers c: the identity permutation matches Fin.append (c ∘ (Fin.last n).succAbove) ![c (Fin.last n)] with c.
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 open Fin in lemma TensorSpecies.Tensor.IsReindexing.append_succ_last {n : ℕ} (c : Fin (n + 1) → C) : IsReindexing (Fin.append (c ∘ (Fin.last n).succAbove) ![c (Fin.last n)]) c id
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.append_succ_last`
- 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_succ_last← TensorSpecies.Tensor.IsReindexing.append_succ_last (Physlib/Relativity/Tensors/Reindexing.lean:534): 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 TensorSpecies.Tensor.IsReindexing inopen Module invariable {C : Type} inopen Fin in/-- Splitting a list of colours `c : Fin (n + 1) → C` into its first `n` entries and its last entry recovers `c`: the identity permutation matches `Fin.append (c ∘ (Fin.last n).succAbove) ![c (Fin.last n)]` with `c`. -/lemma TensorSpecies.Tensor.IsReindexing.append_succ_last {n : ℕ} (c : Fin (n + 1) → C) : IsReindexing (Fin.append (c ∘ (Fin.last n).succAbove) ![c (Fin.last n)]) c id := by rw [Fin.succAbove_last, on_id] refine Fin.addCases (fun i => ?_) (fun i => ?_) · simp only [Fin.append_left, Function.comp_apply]; rfl · fin_cases i; simp only [Fin.append_right, Matrix.cons_val_fin_one]; rfl