AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.inv_perserve_color

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.inv_perserve_color

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
set_option warning.simp.varHead false in
@[simp]
lemma TensorSpecies.Tensor.IsReindexing.inv_perserve_color {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    {σ : Fin m → Fin n} (h : IsReindexing c c1 σ) (x : Fin n) :
    c1 (h.inv σ x) = c x
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.inv_perserve_color`
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 5
Used by 26

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} inset_option warning.simp.varHead false in@[simp]lemma TensorSpecies.Tensor.IsReindexing.inv_perserve_color {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}    {σ : Fin m → Fin n} (h : IsReindexing c c1 σ) (x : Fin n) :    c1 (h.inv σ x) = c x := by  obtain ⟨x, rfl⟩ := h.toEquiv.symm.surjective x  change c1 (h.toEquiv _) = _  simp only [Equiv.apply_symm_apply]  rw [h.preserve_color]  rfl
See it in the graphDiscuss this resultChallenge it