AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_apply_lt_lt

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_apply_lt_lt

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_apply_lt_lt {n : ℕ}
    (i j : Fin (n + 1 + 1)) (m : Fin n) (hi : m.val < i.val) (hj : m.val < j.val) :
    succSuccAbove i j m = m.castSucc.castSucc
Formalizes
Physlib, `Fin.succSuccAbove_apply_lt_lt`
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
Quot.soundpropext
Built on 11

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_apply_lt_lt {n : ℕ}    (i j : Fin (n + 1 + 1)) (m : Fin n) (hi : m.val < i.val) (hj : m.val < j.val) :    succSuccAbove i j m = m.castSucc.castSucc := by  ext  simp [succSuccAbove, hi, hj]
See it in the graphDiscuss this resultChallenge it