AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_eq_predAbove

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_eq_predAbove

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_eq_predAbove {i j : Fin (n + 1 + 1)} (hij : i ≠ j) :
    succSuccAbove i j = fun x => i.succAbove (((Fin.predAbove 0 i).predAbove j).succAbove x)
Formalizes
Physlib, `Fin.succSuccAbove_eq_predAbove`
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
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 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_eq_predAbove {i j : Fin (n + 1 + 1)} (hij : i ≠ j) :    succSuccAbove i j = fun x => i.succAbove (((Fin.predAbove 0 i).predAbove j).succAbove x) := by  rcases Fin.eq_self_or_eq_succAbove i j with rfl | ⟨j, rfl⟩  · contradiction  · ext x    rw [succSuccAbove_eq_succAbove_succAbove, Function.comp_apply]    congr    rcases eq_or_ne i 0 with rfl | hi    · rfl    · rw [Fin.predAbove_zero_of_ne_zero hi]      rcases lt_or_ge (i.pred hi).castSucc (i.succAbove j) with h | h      · rw [Fin.predAbove_of_castSucc_lt _ _ h, Fin.pred_succAbove]        rw [← Fin.lt_succAbove_iff_le_castSucc]        exact lt_of_le_of_ne ((Fin.castSucc_pred_lt_iff hi).mp h) hij      · rw [Fin.predAbove_of_le_castSucc _ _ h, Fin.castPred_succAbove]        rw [Fin.castSucc_lt_iff_succ_le, ← Fin.succAbove_lt_iff_succ_le]        exact (Fin.le_castSucc_pred_iff hi).mp h
See it in the graphDiscuss this resultChallenge it