AFTD Auto-Formalizing Theoretical Domains

Fin.predPredAbove_surjective

theoremverifiedformalizationimported Lean

Fin.predPredAbove_surjective

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.predPredAbove_surjective (i j : Fin (n + 1 + 1)) (hij : i ≠ j)
    (m : Fin n) : ∃ m' : Fin (n + 1 + 1), ∃ (h : m' ≠ i ∧ m' ≠ j),
    predPredAbove i j hij m' h = m
Formalizes
Physlib, `Fin.predPredAbove_surjective`
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 15

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.predPredAbove_surjective (i j : Fin (n + 1 + 1)) (hij : i ≠ j)    (m : Fin n) : ∃ m' : Fin (n + 1 + 1), ∃ (h : m' ≠ i ∧ m' ≠ j),    predPredAbove i j hij m' h = m := by  refine ⟨succSuccAbove i j m, by simp [Ne.symm], succSuccAbove_injective i j ?_⟩  simp
See it in the graphDiscuss this resultChallenge it