AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_eq_succAbove_succAbove

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_eq_succAbove_succAbove

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_succAbove_succAbove (i : Fin (n + 1 + 1)) (j : Fin (n + 1)) :
    succSuccAbove i (i.succAbove j) = i.succAbove ∘ j.succAbove
Formalizes
Physlib, `Fin.succSuccAbove_eq_succAbove_succAbove`
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 3
  • Fin.succSuccAboveThe embedding of Fin n into Fin (n + 1 + 1) which leaves a hole at i and j.
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
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_eq_succAbove_succAbove (i : Fin (n + 1 + 1)) (j : Fin (n + 1)) :    succSuccAbove i (i.succAbove j) = i.succAbove ∘ j.succAbove := by  ext m  simp only [succSuccAbove, succAbove, lt_def, val_castSucc, Function.comp_apply]  grind
See it in the graphDiscuss this resultChallenge it