AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.update_update_of_eq

theoremverifiedformalizationimported Lean

Updating slot i of c to d and then back to e = c i returns c, no other slot moving: the colour cast a round trip of two contractions at slot i generates.

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.update_update_of_eq {n : ℕ} {c : Fin n → C} {d e : C} (i : Fin n) (he : c i = e) :
    IsReindexing c (Function.update (Function.update c i d) i e) (id : Fin n → Fin n)
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.update_update_of_eq`
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 TensorSpecies.Tensor.IsReindexing inopen Module invariable {C : Type} inopen Fin in/-- Updating slot `i` of `c` to `d` and then back to `e = c i` returns `c`, no other slot moving: the colour cast a round trip of two contractions at slot `i` generates. -/lemma TensorSpecies.Tensor.IsReindexing.update_update_of_eq {n : ℕ} {c : Fin n → C} {d e : C} (i : Fin n) (he : c i = e) :    IsReindexing c (Function.update (Function.update c i d) i e) (id : Fin n → Fin n) :=  on_id.mpr (fun j => by by_cases h : j = i <;> simp [h, Function.update_of_ne, he])
See it in the graphDiscuss this resultChallenge it