AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_ne_fst

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_ne_fst

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_ne_fst (i j : Fin (n + 1 + 1)) (m : Fin n) :
    ¬ succSuccAbove i j m = i
Formalizes
Physlib, `Fin.succSuccAbove_ne_fst`
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 12
Used by 22

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_ne_fst (i j : Fin (n + 1 + 1)) (m : Fin n) :    ¬ succSuccAbove i j m = i := by  simp only [Fin.ext_iff, succSuccAbove_val]  grind (splits := 5)
See it in the graphDiscuss this resultChallenge it