AFTD Auto-Formalizing Theoretical Domains

Cslib.goodSelection_seq_prop

theoremverifiedformalizationimported Lean

At every step, the goodSelection_seq makes a good selection and there are always infinitely many vertices remaining to be selected.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Function Set in
variable {Vertex Color : Type*} [Finite Color] (color : Finset Vertex → Color) in
variable [Infinite Vertex] in
lemma Cslib.goodSelection_seq_prop (n : ℕ) :
    ∃ ivs : InfVSet Vertex, GoodSelection color ivs (goodSelection_seq color n) ∧
      (ivs.set = ⋂ m < n, (goodSelection_seq color m).vs.set)
Formalizes
CSLib, `Cslib.goodSelection_seq_prop`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Ching-Tsun Chou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • Cslib.GoodSelectionA "good selection" S selects an infinite subset S.vs of an infinite vertex set ivs and a distinguished vertex S.v in ivs but not…
  • Cslib.InfVSetAn InfVSet consists of a set of vertices and a proof that the set is infinite.
  • Cslib.goodSelection_seqStarting from the infinite set of all vertices, inductively make an infinite sequence of good selections.
  • Cslib.SelectionA Selection consists of an InfVSet, a vertex, and a color.
Used by 1
  • Cslib.good_selections_existThere exist an infinite sequence vs of vertex sets, an infinite sequence v of vertices, and an infinite sequence c of colors such…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Function Set invariable {Vertex Color : Type*} [Finite Color] (color : Finset Vertex → Color) invariable [Infinite Vertex] in/-- At every step, the `goodSelection_seq` makes a good selection and there are always infinitely many vertices remaining to be selected. -/lemma Cslib.goodSelection_seq_prop (n : ℕ) :    ∃ ivs : InfVSet Vertex, GoodSelection color ivs (goodSelection_seq color n) ∧      (ivs.set = ⋂ m < n, (goodSelection_seq color m).vs.set) := by  induction n  case zero =>    use (InfVSet.mk univ infinite_univ)    simp    grind [goodSelection_seq]  case succ n h_ind =>    obtain ⟨_, _, h_eq⟩ := h_ind    use (goodSelection_seq color n).vs    constructor    · grind [goodSelection_seq]    · have h1 (m : ℕ) : m < n + 1 ↔ m < n ∨ m = n := by grind      simp [h1, iInter_or, iInter_inter_distrib, ← h_eq]      grind [GoodSelection]
See it in the graphDiscuss this resultChallenge it