AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_leq_iff_leq

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_leq_iff_leq

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_leq_iff_leq {n : ℕ}
    (i j : Fin (n + 1 + 1)) (m1 m2 : Fin n) :
    succSuccAbove i j m1 ≤ succSuccAbove i j m2 ↔ m1 ≤ m2
Formalizes
Physlib, `Fin.succSuccAbove_leq_iff_leq`
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 5
Used by 32

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_leq_iff_leq {n : ℕ}    (i j : Fin (n + 1 + 1)) (m1 m2 : Fin n) :    succSuccAbove i j m1 ≤ succSuccAbove i j m2 ↔ m1 ≤ m2 := by  simp only [Fin.le_def, Fin.succSuccAbove_val]  grind (splits := 20)
See it in the graphDiscuss this resultChallenge it