Fin.succSuccAbove_comm
theoremverifiedformalizationimported Lean
Fin.succSuccAbove_comm
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Fin in variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in lemma Fin.succSuccAbove_comm (i1 j1 : Fin (n + 1 + 1 + 1 + 1)) (i2 j2 : Fin (n + 1 + 1)) (hij1 : i1 ≠ j1) (hij2 : i2 ≠ j2) : let i2' := (succSuccAbove i1 j1 i2); let j2' := (succSuccAbove i1 j1 j2); have hi2j2' : i2' ≠ j2' := by simp [i2', j2', hij2]; let i1' := (predPredAbove i2' j2' hi2j2' i1 (by simp [i2', j2'])); let j1' := (predPredAbove i2' j2' hi2j2' j1 (by simp [i2', j2'])); succSuccAbove i1 j1 ∘ succSuccAbove i2 j2 = succSuccAbove i2' j2' ∘ succSuccAbove i1' j1'
- Formalizes
- Physlib, `Fin.succSuccAbove_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.Fin.succSuccAbove_comm← Fin.succSuccAbove_comm (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:356): adapted
What was changed in
Fin.succSuccAbove_comm--- Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:356 (Fin.succSuccAbove_comm) +++ as compiled here @@ -1,2 +1,6 @@ -lemma succSuccAbove_comm (i1 j1 : Fin (n + 1 + 1 + 1 + 1)) (i2 j2 : Fin (n + 1 + 1)) +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Fin in +variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in +lemma Fin.succSuccAbove_comm (i1 j1 : Fin (n + 1 + 1 + 1 + 1)) (i2 j2 : Fin (n + 1 + 1)) (hij1 : i1 ≠ j1) (hij2 : i2 ≠ j2) : @@ -8,3 +12,3 @@ succSuccAbove i1 j1 ∘ succSuccAbove i2 j2 = - succSuccAbove i2' j2' ∘ succSuccAbove i1' j1':= by + succSuccAbove i2' j2' ∘ succSuccAbove i1' j1' := by ext m - Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 19
- Fin.predPredAbove_injectiveFin.predPredAbove_injective
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- Fin.succSuccAbove_predPredAboveFin.succSuccAbove_predPredAbove
- Fin.predPredAboveThe preimage of
mundersuccSuccAbove i j hijgiven thatmis not equal toiorj. - Fin.succSuccAboveThe embedding of
Fin nintoFin (n + 1 + 1)which leaves a hole atiandj. - Fin.apply_succSuccAbove_symmFin.apply_succSuccAbove_symm
- 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.succSuccAbove_valFin.succSuccAbove_val
- Fin.fst_ne_succSuccAbove_preFin.fst_ne_succSuccAbove_pre
- Fin.succSuccAbove_lt_iff_ltFin.succSuccAbove_lt_iff_lt
- Fin.succSuccAbove_ne_sndFin.succSuccAbove_ne_snd
- Fin.predPredAbove_valFin.predPredAbove_val
- Fin.succSuccAbove_rangeFin.succSuccAbove_range
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- Used by 2
- TensorSpecies.Tensor.IsReindexing.succSuccAbove_commRemoving two pairs of entries from
cin either order gives the same colour list: removing thei1-th andj1-th entries and then the… - Fin.succSuccAbove_comm_applyFin.succSuccAbove_comm_apply
- TensorSpecies.Tensor.IsReindexing.succSuccAbove_commRemoving two pairs of entries from
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 Fin invariable {n : ℕ} {c : Fin (n + 1 + 1) → C} inlemma Fin.succSuccAbove_comm (i1 j1 : Fin (n + 1 + 1 + 1 + 1)) (i2 j2 : Fin (n + 1 + 1)) (hij1 : i1 ≠ j1) (hij2 : i2 ≠ j2) : let i2' := (succSuccAbove i1 j1 i2); let j2' := (succSuccAbove i1 j1 j2); have hi2j2' : i2' ≠ j2' := by simp [i2', j2', hij2]; let i1' := (predPredAbove i2' j2' hi2j2' i1 (by simp [i2', j2'])); let j1' := (predPredAbove i2' j2' hi2j2' j1 (by simp [i2', j2'])); succSuccAbove i1 j1 ∘ succSuccAbove i2 j2 = succSuccAbove i2' j2' ∘ succSuccAbove i1' j1' := by ext m simp only [Function.comp_apply, predPredAbove_val, succSuccAbove_val] grind (splits := 20)