AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_succAbove_comm_apply

theoremverifiedformalizationimported Lean

Pointwise form of commuting deletion of one slot with deletion of a pair.

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_succAbove_comm_apply {n : ℕ} (i j : Fin (n + 1 + 1 + 1))
    (k : Fin (n + 1)) (m : Fin n) :
    (i.succSuccAbove j k).succAbove
        (((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove i).succSuccAbove
          ((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove j) m) =
      i.succSuccAbove j (k.succAbove m)
Formalizes
Physlib, `Fin.succSuccAbove_succAbove_comm_apply`
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 16
Used by 1

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/-- Pointwise form of commuting deletion of one slot with deletion of a pair. -/lemma Fin.succSuccAbove_succAbove_comm_apply {n : ℕ} (i j : Fin (n + 1 + 1 + 1))    (k : Fin (n + 1)) (m : Fin n) :    (i.succSuccAbove j k).succAbove        (((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove i).succSuccAbove          ((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove j) m) =      i.succSuccAbove j (k.succAbove m) := by  apply Fin.val_injective  simp only [Fin.succSuccAbove, Fin.succAbove, Fin.predAbove, Fin.lt_def, Fin.val_castSucc,    Fin.val_succ, Fin.castPred, apply_ite Fin.val]  grind (splits := 60)
See it in the graphDiscuss this resultChallenge it