AFTD Auto-Formalizing Theoretical Domains

regular_word_subtraction_game_state_set

def

The candidate reachable-state set R0 = {∅} ∪ {S ⊆ {1,...,N} : S meets {1,2,3}} of the subset construction for the winning-position language.

Statement

noncomputable def regular_word_subtraction_game_state_set (N : ℕ) (hN : 3 ≤ N) : Finset (Finset (Fin (N + 1)))
Source
step towards op_1677_regular_word_subtraction_state_complexity_ge
Verified
16 Nov 2026
Axioms
none listed

Lean source view module on GitHub

/-- R0: the empty set together with all subsets of {1,...,N} meeting {1,2,3}. -/
noncomputable def regular_word_subtraction_game_state_set (N : ℕ) (hN : 3 ≤ N) : Finset (Finset (Fin (N + 1))) := insert ∅ ((((Finset.univ : Finset (Fin (N + 1))) \ {⟨0, by omega⟩}).powerset).filter
      (fun S => (S ∩ ({⟨1, by omega⟩, ⟨2, by omega⟩, ⟨3, by omega⟩} : Finset (Fin (N + 1)))).Nonempty))
See it in the graphDiscuss this resultChallenge it