TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm
theoremverifiedformalizationimported Lean
TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm
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.succSuccAbove_succAbove_comm {n : ℕ} {c : Fin (n + 1 + 1 + 1) → C} (k : Fin (n + 1)) (i j : Fin (n + 1 + 1 + 1)) : -- The corresponding position of k in the full list. let k' := Fin.succSuccAbove i j k let k'' := Fin.predAbove 0 k' -- The position of i after removing k' let i' := k''.predAbove i -- The position of j after removing k' let j' := k''.predAbove j IsReindexing ((c ∘ k'.succAbove) ∘ i'.succSuccAbove j') ((c ∘ i.succSuccAbove j) ∘ k.succAbove) id
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm`
- 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.succSuccAbove_succAbove_comm← TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm (Physlib/Relativity/Tensors/Reindexing.lean:498): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 18
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- Fin.succSuccAbove_predPredAboveFin.succSuccAbove_predPredAbove
- Fin.succSuccAboveThe embedding of
Fin nintoFin (n + 1 + 1)which leaves a hole atiandj. - TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexing.inv_perserve_colorTensorSpecies.Tensor.IsReindexing.inv_perserve_color
- Fin.apply_succSuccAbove_symmFin.apply_succSuccAbove_symm
- Fin.succSuccAbove_succAbove_comm_applyPointwise form of commuting deletion of one slot with deletion of a pair.
- Fin.succSuccAbove_eq_iff_eqFin.succSuccAbove_eq_iff_eq
- Fin.succSuccAbove_ne_fstFin.succSuccAbove_ne_fst
- Fin.predPredAbove_succSuccAboveFin.predPredAbove_succSuccAbove
- Fin.succSuccAbove_leq_iff_leqFin.succSuccAbove_leq_iff_leq
- Fin.fst_ne_succSuccAbove_preFin.fst_ne_succSuccAbove_pre
- Fin.succSuccAbove_lt_iff_ltFin.succSuccAbove_lt_iff_lt
- TensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_colorTensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_color
- TensorSpecies.Tensor.IsReindexingGiven two lists of indices
c : Fin n → Candc1 : Fin m → Ca mapσ : Fin m → Fin nsatisfies the conditionIsReindexing c c1 σif… - Fin.succSuccAbove_ne_sndFin.succSuccAbove_ne_snd
- Fin.succSuccAbove_rangeFin.succSuccAbove_range
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 inopen Module invariable {C : Type} inopen Fin inlemma TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm {n : ℕ} {c : Fin (n + 1 + 1 + 1) → C} (k : Fin (n + 1)) (i j : Fin (n + 1 + 1 + 1)) : -- The corresponding position of k in the full list. let k' := Fin.succSuccAbove i j k let k'' := Fin.predAbove 0 k' -- The position of i after removing k' let i' := k''.predAbove i -- The position of j after removing k' let j' := k''.predAbove j IsReindexing ((c ∘ k'.succAbove) ∘ i'.succSuccAbove j') ((c ∘ i.succSuccAbove j) ∘ k.succAbove) id := by refine ⟨Function.bijective_id, fun m => ?_⟩ simp only [id_eq, Function.comp_apply] congr 1 exact Fin.succSuccAbove_succAbove_comm_apply i j k m