TensorSpecies.Tensor.IsReindexing.inv_equiv_symm_eq
theoremverifiedformalizationimported Lean
TensorSpecies.Tensor.IsReindexing.inv_equiv_symm_eq
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.inv_equiv_symm_eq {n : ℕ} {c c1 : Fin n → C} (e : Equiv.Perm (Fin n)) (h : IsReindexing c c1 ⇑e.symm) (x : Fin n) : h.inv ⇑e.symm x = e x
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.inv_equiv_symm_eq`
- 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.inv_equiv_symm_eq← TensorSpecies.Tensor.IsReindexing.inv_equiv_symm_eq (Physlib/Relativity/Tensors/Reindexing.lean:157): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- TensorSpecies.Tensor.IsReindexing.symmThe inverse of a map satisfying
IsReindexing c c1 σis a reindexing ofc1byc. - TensorSpecies.Tensor.IsReindexing.invFor a map
σsatisfyingIsReindexing c c1 σ, the inverse of that map. - TensorSpecies.Tensor.IsReindexing.injectiveTensorSpecies.Tensor.IsReindexing.injective
- TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexing.inv_apply_applyTensorSpecies.Tensor.IsReindexing.inv_apply_apply
- TensorSpecies.Tensor.IsReindexingGiven two lists of indices
c : Fin n → Candc1 : Fin m → Ca mapσ : Fin m → Fin nsatisfies the conditionIsReindexing c c1 σif…
- TensorSpecies.Tensor.IsReindexing.symmThe inverse of a map satisfying
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.inv_equiv_symm_eq {n : ℕ} {c c1 : Fin n → C} (e : Equiv.Perm (Fin n)) (h : IsReindexing c c1 ⇑e.symm) (x : Fin n) : h.inv ⇑e.symm x = e x := by have hx := h.inv_apply_apply ⇑e.symm x apply e.symm.injective rw [hx, Equiv.symm_apply_apply]