TensorSpecies.Tensor.IsReindexing.on_id_symm
theoremverifiedformalizationimported Lean
TensorSpecies.Tensor.IsReindexing.on_id_symm
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.on_id_symm {n : ℕ} {c c1 : Fin n → C} (h : IsReindexing c1 c id) : IsReindexing c c1 (id : Fin n → Fin n)
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.on_id_symm`
- 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.TensorSpecies.Tensor.IsReindexing.on_id_symm← TensorSpecies.Tensor.IsReindexing.on_id_symm (Physlib/Relativity/Tensors/Reindexing.lean:105): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexingGiven two lists of indices
c : Fin n → Candc1 : Fin m → Ca mapσ : Fin m → Fin nsatisfies the conditionIsReindexing c c1 σif…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen TensorSpecies TensorSpecies.Tensor TensorSpecies.Tensor.IsReindexing inopen Module invariable {C : Type} inlemma TensorSpecies.Tensor.IsReindexing.on_id_symm {n : ℕ} {c c1 : Fin n → C} (h : IsReindexing c1 c id) : IsReindexing c c1 (id : Fin n → Fin n) := by simp at h ⊢ exact fun i => (h i).symm