AFTD Auto-Formalizing Theoretical Domains

mem_palette_active_vertices

theoremverified

For a finite type V, a natural number k, a palette system P : V → Finset (Fin k), and a vertex v : V, v is in palette_active_vertices P if and only if P v ≠ ∅.

Statement

theorem mem_palette_active_vertices {V : Type*} [Fintype V] {k : ℕ} (P : V → Finset (Fin k)) (v : V) : v ∈ palette_active_vertices P ↔ P v ≠ ∅
Source
arXiv:2610.31489, Section 2
Verified
24 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • palette_active_verticesGiven a finite type V, a natural number k, and a palette system P : V → Finset (Fin k), palette_active_vertices P is the Finset of all…

Read back from the Lean

For any finite type $V$, any natural number $k$, any function $P : V \to \mathrm{Finset}(\mathrm{Fin}\, k)$, and any vertex/element $v \in V$, $v$ is an element of palette_active_vertices P if and only if $P(v) \neq \emptyset$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The theorem establishes that a vertex is active in a palette system if and only if its palette is nonempty. Active vertices are defined by filtering the universal set of vertices with the condition P v ≠ ∅. The proof unfolds this definition and simplifies membership in the filtered finset to the defining condition.

  1. A vertex v belongs to palette_active_vertices P if and only if P v ≠ ∅. automation

    By definition, palette_active_vertices P is the sub-finset of the universal set of vertices Finset.univ filtered by the condition P v ≠ ∅. Unfolding this definition, membership of v in the filtered set reduces to v ∈ Finset.univ and P v ≠ ∅. Since v is trivially in the universal set of the finite type V, the condition simplifies directly to P v ≠ ∅.

    line 2

    uses palette_active_vertices

    theorem mem_palette_active_vertices {V : Type*} [Fintype V] {k : ℕ} (P : V → Finset (Fin k)) (v : V) : v ∈ palette_active_vertices P ↔ P v ≠ ∅ := by simp [palette_active_vertices]
palette_active_vertices
The finite set of all vertices in V whose palette under P is nonempty, defined by filtering Finset.univ with the predicate P v ≠ ∅.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Characterization of active vertices in a palette system. -/theorem mem_palette_active_vertices {V : Type*} [Fintype V] {k : ℕ} (P : V → Finset (Fin k)) (v : V) : v ∈ palette_active_vertices P ↔ P v ≠ ∅ := by simp [palette_active_vertices]
See it in the graphDiscuss this resultChallenge it