AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm

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.succSuccAbove_succAbove_comm {n : ℕ} {c : Fin (n + 1 + 1 + 1) → C}
    (k : Fin (n + 1)) (i j : Fin (n + 1 + 1 + 1)) :
    -- The corresponding position of k in the full list.
    let k' := Fin.succSuccAbove i j k
    let k'' := Fin.predAbove 0 k'
    -- The position of i after removing k'
    let i' := k''.predAbove i
    -- The position of j after removing k'
    let j' := k''.predAbove j
    IsReindexing ((c ∘ k'.succAbove) ∘ i'.succSuccAbove j')
      ((c ∘ i.succSuccAbove j) ∘ k.succAbove) id
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm`
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 18

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.succSuccAbove_succAbove_comm {n : ℕ} {c : Fin (n + 1 + 1 + 1) → C}    (k : Fin (n + 1)) (i j : Fin (n + 1 + 1 + 1)) :    -- The corresponding position of k in the full list.    let k' := Fin.succSuccAbove i j k    let k'' := Fin.predAbove 0 k'    -- The position of i after removing k'    let i' := k''.predAbove i    -- The position of j after removing k'    let j' := k''.predAbove j    IsReindexing ((c ∘ k'.succAbove) ∘ i'.succSuccAbove j')      ((c ∘ i.succSuccAbove j) ∘ k.succAbove) id := by  refine ⟨Function.bijective_id, fun m => ?_⟩  simp only [id_eq, Function.comp_apply]  congr 1  exact Fin.succSuccAbove_succAbove_comm_apply i j k m
See it in the graphDiscuss this resultChallenge it