AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.append_succAbove_natAdd

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.append_succAbove_natAdd

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_succAbove_natAdd {n n1 : ℕ} {c : Fin n → C} {c1 : Fin (n1 + 1) → C}
    (i : Fin (n1 + 1)) :
    IsReindexing (Fin.append c c1 ∘ (Fin.natAdd n i).succAbove)
      (Fin.append c (c1 ∘ i.succAbove)) id
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.append_succAbove_natAdd`
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
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

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 inlemma TensorSpecies.Tensor.IsReindexing.append_succAbove_natAdd {n n1 : ℕ} {c : Fin n → C} {c1 : Fin (n1 + 1) → C}    (i : Fin (n1 + 1)) :    IsReindexing (Fin.append c c1 ∘ (Fin.natAdd n i).succAbove)      (Fin.append c (c1 ∘ i.succAbove)) id := by  refine ⟨Function.bijective_id, fun x => ?_⟩  simp only [Function.comp_apply, id_eq]  refine Fin.addCases (fun a => ?_) (fun a => ?_) x  · have hidx : (Fin.natAdd n i).succAbove (Fin.castAdd n1 a) = Fin.castAdd (n1 + 1) a := by      rw [Fin.succAbove_of_castSucc_lt]      · ext        simp      · simp only [Fin.lt_def, Fin.val_castSucc, Fin.val_castAdd, Fin.val_natAdd]        omega    simp [hidx, Fin.append_left]  · have hidx : (Fin.natAdd n i).succAbove (Fin.natAdd n a) = Fin.natAdd n (i.succAbove a) := by      have hcond : ((Fin.natAdd n a).castSucc < Fin.natAdd n i) ↔ (a.castSucc < i) := by        simp only [Fin.lt_def, Fin.val_castSucc, Fin.val_natAdd]        omega      simp only [Fin.succAbove, hcond]      split_ifs <;> ext <;> simp [Nat.add_assoc]    simp [hidx, Fin.append_right]
See it in the graphDiscuss this resultChallenge it