TensorSpecies.Tensor.IsReindexing.auto
theoremverifiedformalizationimported Lean
TensorSpecies.Tensor.IsReindexing.auto
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open TensorSpecies TensorSpecies.Tensor in open Module in variable {C : Type} in lemma TensorSpecies.Tensor.IsReindexing.auto {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C} {σ : Fin m → Fin n} (h : IsReindexing c c1 σ := by {simp [IsReindexing]; try decide}) : IsReindexing c c1 σ
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.auto`
- 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.auto← TensorSpecies.Tensor.IsReindexing.auto (Physlib/Relativity/Tensors/Reindexing.lean:95): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 1
- 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.IsReindexingGiven two lists of indices
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open TensorSpecies TensorSpecies.Tensor in open Module in variable {C : Type} in lemma TensorSpecies.Tensor.IsReindexing.auto {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C} {σ : Fin m → Fin n} (h : IsReindexing c c1 σ := by {simp [IsReindexing]; try decide}) : IsReindexing c c1 σ := h