AFTD Auto-Formalizing Theoretical Domains

Fin.apply_succSuccAbove_symm

theoremverifiedformalizationimported Lean

Fin.apply_succSuccAbove_symm

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Fin in
variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in
set_option warning.simp.varHead false in
@[simp]
lemma Fin.apply_succSuccAbove_symm {c : Fin (n + 1 + 1) → C} (i j : Fin (n + 1 + 1))
    (k : Fin n) : c (succSuccAbove i j k) = c (succSuccAbove j i k)
Formalizes
Physlib, `Fin.apply_succSuccAbove_symm`
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 7
Used by 25

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Fin invariable {n : ℕ} {c : Fin (n + 1 + 1) → C} inset_option warning.simp.varHead false in@[simp]lemma Fin.apply_succSuccAbove_symm {c : Fin (n + 1 + 1) → C} (i j : Fin (n + 1 + 1))    (k : Fin n) : c (succSuccAbove i j k) = c (succSuccAbove j i k) := by  rw [succSuccAbove_symm]
See it in the graphDiscuss this resultChallenge it