AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.append_of_first

theoremverifiedformalizationimported Lean

Splitting a list of colours c : Fin (n + 1) → C into its first entry and its remaining n entries recovers c: the canonical reindexing Fin (1 + n) ≃ Fin (n + 1) matches Fin.append ![c 0] (c ∘ Fin.succAbove 0) with c.

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_of_first {n : ℕ} (c : Fin (n + 1) → C) :
    IsReindexing (Fin.append ![c 0] (c ∘ Fin.succAbove 0)) c (Fin.cast (by grind))
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.append_of_first`
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
Classical.choiceQuot.soundpropext
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/-- Splitting a list of colours `c : Fin (n + 1) → C` into its first entry and its remaining `n` entries recovers `c`: the canonical reindexing `Fin (1 + n) ≃ Fin (n + 1)` matches `Fin.append ![c 0] (c ∘ Fin.succAbove 0)` with `c`. -/lemma TensorSpecies.Tensor.IsReindexing.append_of_first {n : ℕ} (c : Fin (n + 1) → C) :    IsReindexing (Fin.append ![c 0] (c ∘ Fin.succAbove 0)) c (Fin.cast (by grind)) := by  refine ⟨(finCongr (by grind)).bijective, fun i => ?_⟩  rcases Fin.eq_zero_or_eq_succ i with rfl | ⟨i, rfl⟩  · rfl  · simpa using congrArg (Fin.append ![c 0] (c ∘ Fin.succ)) (a₁ := Fin.cast _ i.succ)      (a₂ := Fin.natAdd 1 i) (by ext; grind)
See it in the graphDiscuss this resultChallenge it