AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_natAdd_image_range_castAdd

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_natAdd_image_range_castAdd

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_natAdd_image_range_castAdd {n n1 : ℕ}
    (i j : Fin (n + 1 + 1)) :
    (succSuccAbove (n := n1 + n) (Fin.natAdd n1 i) (Fin.natAdd n1 j)) ''
    (Set.range (Fin.castAdd (m := n) (n := n1))) = {i | i.1 < n1}
Formalizes
Physlib, `Fin.succSuccAbove_natAdd_image_range_castAdd`
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 14

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_natAdd_image_range_castAdd {n n1 : ℕ}    (i j : Fin (n + 1 + 1)) :    (succSuccAbove (n := n1 + n) (Fin.natAdd n1 i) (Fin.natAdd n1 j)) ''    (Set.range (Fin.castAdd (m := n) (n := n1))) = {i | i.1 < n1} := by  ext a  simp only [Set.mem_image, Set.mem_range, exists_exists_eq_and, Set.mem_ofPred_eq]  conv_lhs =>    enter [1, b]    rw [succSuccAbove_natAdd_apply_castAdd i j]  apply Iff.intro  · rintro ⟨b, rfl⟩    simp  · exact fun h ↦ ⟨⟨a, by omega⟩, by simp⟩
See it in the graphDiscuss this resultChallenge it