AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_comm_natAdd

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_comm_natAdd

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_natAdd {n n1 : ℕ}
    (i j : Fin (n + 1 + 1)) (m : Fin n) :
    succSuccAbove (n := n1 + n) (Fin.natAdd n1 i) (Fin.natAdd n1 j) (Fin.natAdd n1 m)
    = Fin.natAdd (n1) (succSuccAbove i j m)
Formalizes
Physlib, `Fin.succSuccAbove_comm_natAdd`
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.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 14
Used by 1

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_natAdd {n n1 : ℕ}    (i j : Fin (n + 1 + 1)) (m : Fin n) :    succSuccAbove (n := n1 + n) (Fin.natAdd n1 i) (Fin.natAdd n1 j) (Fin.natAdd n1 m)    = Fin.natAdd (n1) (succSuccAbove i j m) := by  simp only [succSuccAbove, val_natAdd, Fin.ext_iff]  grind
See it in the graphDiscuss this resultChallenge it