AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_predPredAbove

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_predPredAbove

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Fin in
variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in
@[simp]
lemma Fin.succSuccAbove_predPredAbove (i j : Fin (n + 1 + 1)) (hij : i ≠ j) (m : Fin (n + 1 + 1))
    (hm : m ≠ i ∧ m ≠ j) :
    succSuccAbove i j (predPredAbove i j hij m hm) = m
Formalizes
Physlib, `Fin.succSuccAbove_predPredAbove`
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 14

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Fin invariable {n : ℕ} {c : Fin (n + 1 + 1) → C} in@[simp]lemma Fin.succSuccAbove_predPredAbove (i j : Fin (n + 1 + 1)) (hij : i ≠ j) (m : Fin (n + 1 + 1))    (hm : m ≠ i ∧ m ≠ j) :    succSuccAbove i j (predPredAbove i j hij m hm) = m := by  dsimp [succSuccAbove, predPredAbove]  grind
See it in the graphDiscuss this resultChallenge it