AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.append_succAbove_castAdd

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.append_succAbove_castAdd

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_castAdd {n n1 : ℕ} {c : Fin (n + 1) → C} {c1 : Fin (n1 + 1) → C}
    (i : Fin (n + 1)) :
    IsReindexing (Fin.append c c1 ∘ (Fin.castAdd (n1 + 1) i).succAbove)
      (Fin.append (c ∘ i.succAbove) c1) (Fin.cast (by grind))
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.append_succAbove_castAdd`
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 6

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_castAdd {n n1 : ℕ} {c : Fin (n + 1) → C} {c1 : Fin (n1 + 1) → C}    (i : Fin (n + 1)) :    IsReindexing (Fin.append c c1 ∘ (Fin.castAdd (n1 + 1) i).succAbove)      (Fin.append (c ∘ i.succAbove) c1) (Fin.cast (by grind)) := by  refine ⟨(finCongr (by grind)).bijective, fun y => ?_⟩  simp only [Function.comp_apply]  refine Fin.addCases (fun a => ?_) (fun a => ?_) y  · have hidx : (Fin.castAdd (n1 + 1) i).succAbove (Fin.cast (by grind) (Fin.castAdd (n1 + 1) a))        = Fin.castAdd (n1 + 1) (i.succAbove a) := by      have hcond : ((Fin.cast (by grind) (Fin.castAdd (n1 + 1) a)).castSucc <          Fin.castAdd (n1 + 1) i) ↔ (a.castSucc < i) := by        simp only [Fin.lt_def, Fin.val_castSucc, Fin.val_cast, Fin.val_castAdd]      simp only [Fin.succAbove, hcond]      split_ifs <;> ext <;> simp    simp [hidx, Fin.append_left]  · have hidx : (Fin.castAdd (n1 + 1) i).succAbove (Fin.cast (by grind) (Fin.natAdd n a))        = Fin.natAdd (n + 1) a := by      rw [Fin.succAbove_of_le_castSucc]      · ext        simp [Nat.add_right_comm]      · simp only [Fin.le_def, Fin.val_castSucc, Fin.val_cast, Fin.val_natAdd, Fin.val_castAdd]        omega    simp [hidx, Fin.append_right]
See it in the graphDiscuss this resultChallenge it