AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.apply_inv_apply

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.apply_inv_apply

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
lemma TensorSpecies.Tensor.IsReindexing.apply_inv_apply {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    (σ : Fin m → Fin n) (h : IsReindexing c c1 σ) (x : Fin m) :
    h.inv σ (σ x) = x
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.apply_inv_apply`
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} inlemma TensorSpecies.Tensor.IsReindexing.apply_inv_apply {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}    (σ : Fin m → Fin n) (h : IsReindexing c c1 σ) (x : Fin m) :    h.inv σ (σ x) = x := by  change h.toEquiv (h.toEquiv.symm x) = x  simp
See it in the graphDiscuss this resultChallenge it