AFTD Auto-Formalizing Theoretical Domains

Fin.succSuccAbove_image_compl

theoremverifiedformalizationimported Lean

Fin.succSuccAbove_image_compl

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_image_compl {i j : Fin (n + 1 + 1)} (hij : i ≠ j)
    (X : Set (Fin n)) :
    (succSuccAbove i j) '' Xᶜ = ({i, j} ∪ succSuccAbove i j '' X)ᶜ
Formalizes
Physlib, `Fin.succSuccAbove_image_compl`
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 8

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_image_compl {i j : Fin (n + 1 + 1)} (hij : i ≠ j)    (X : Set (Fin n)) :    (succSuccAbove i j) '' Xᶜ = ({i, j} ∪ succSuccAbove i j '' X)ᶜ := by  rw [← compl_inj_iff, Function.Injective.compl_image_eq (succSuccAbove_injective i j)]  simp only [compl_compl, succSuccAbove_range hij]  exact Set.union_comm ((succSuccAbove i j) '' X) {i, j}
See it in the graphDiscuss this resultChallenge it