AFTD Auto-Formalizing Theoretical Domains

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.
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
Used by 2

Lean source view module on GitHub

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)
See it in the graphDiscuss this resultChallenge it