AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.swap

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.swap

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.swap {n : ℕ} {c : Fin n → C} (i j : Fin n) :
    IsReindexing c (c ∘ Equiv.swap i j) (Equiv.swap i j)
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.swap`
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 inopen Module invariable {C : Type} inopen Fin inlemma TensorSpecies.Tensor.IsReindexing.swap {n : ℕ} {c : Fin n → C} (i j : Fin n) :    IsReindexing c (c ∘ Equiv.swap i j) (Equiv.swap i j) := by  simp [IsReindexing]
See it in the graphDiscuss this resultChallenge it