AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_range

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_range

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_range {i j : Fin (n + 1 + 1)} (hij : i ≠ j) :
    Set.range (succSuccAbove i j) = {i, j}ᶜ
Formalizes
Physlib, `Fin.succSuccAbove_range`
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 6
Used by 27

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_range {i j : Fin (n + 1 + 1)} (hij : i ≠ j) :    Set.range (succSuccAbove i j) = {i, j}ᶜ := by  rcases Fin.eq_self_or_eq_succAbove i j with rfl | ⟨j, rfl⟩  · simp_all  rw [succSuccAbove_eq_succAbove_succAbove, Set.range_comp, Fin.range_succAbove]  ext a  simp only [Set.mem_compl_iff, Set.mem_singleton_iff, Set.mem_image]  apply Iff.intro  · intro h    obtain ⟨b, h1, rfl⟩ := h    simpa using h1  · intro h    simp at h    rcases Fin.eq_self_or_eq_succAbove i a with rfl | ⟨a, rfl⟩    · simp_all    use a    simp_all
See it in the graphDiscuss this resultChallenge it