AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.on_id

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.on_id

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor in
open Module in
variable {C : Type} in
@[simp]
lemma TensorSpecies.Tensor.IsReindexing.on_id {n : ℕ} {c c1 : Fin n → C} :
    IsReindexing c c1 (id : Fin n → Fin n) ↔ ∀ i, c i = c1 i
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.on_id`
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 1
  • TensorSpecies.Tensor.IsReindexingGiven two lists of indices c : Fin n → C and c1 : Fin m → C a map σ : Fin m → Fin n satisfies the condition IsReindexing c c1 σ if…
Used by 37

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen TensorSpecies TensorSpecies.Tensor inopen Module invariable {C : Type} in@[simp]lemma TensorSpecies.Tensor.IsReindexing.on_id {n : ℕ} {c c1 : Fin n → C} :    IsReindexing c c1 (id : Fin n → Fin n) ↔ ∀ i, c i = c1 i := by  simp [IsReindexing]
See it in the graphDiscuss this resultChallenge it