AFTD Auto-Formalizing Theoretical Domains

spider_grundy_val_one_one_up_to_five

theoremverified

For every natural number z with 1 ≤ z and z ≤ 5, the Grundy value spider_grundy_val 1 1 z of the spider tree S(1, 1, z) in the Game of Arrows is equal to z % 2.

Statement

theorem spider_grundy_val_one_one_up_to_five (z : ℕ) (h1 : 1 ≤ z) (h5 : z ≤ 5) :
    spider_grundy_val 1 1 z = z % 2
Source
folklore
Verified
20 Oct 2026
Axioms
Quot.soundpropext
Built on 1
  • spider_grundy_valThe Grundy value spider_grundy_val of the 3-legged spider tree with leg parameters x, y, z : ℕ is defined as spider_gamma (x + y + z + 1)…

Read back from the Lean

For every natural number $z$, if $1 \le z$ and $z \le 5$, then spider_grundy_val 1 1 z equals $z \pmod 2$.

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 states that the Grundy value of the spider tree $S(1, 1, z)$ in the Game of Arrows equals $z \bmod 2$ for all $1 \le z \le 5$. Because the range of $z$ is finite and the Grundy value function is computable, the proof proceeds by finite case exhaustion. The tactic `interval_cases` enumerates the values $z \in \{1, 2, 3, 4, 5\}$, and each resulting numerical identity is verified by direct computational evaluation.

  1. For each integer $z$ in the range $1 \le z \le 5$, $\operatorname{spider\_grundy\_val}(1, 1, z) = z \bmod 2$.

    Given the bounds $1 \le z$ and $z \le 5$, the tactic `interval_cases` reduces the goal to the five cases $z \in \{1, 2, 3, 4, 5\}$. For each individual case, the equation consists solely of concrete closed terms, allowing the `decide` tactic to evaluate both the recursive definition of `spider_grundy_val` and the modulo operation directly, confirming equality in all five instances.

    line 4

      interval_cases z <;> decide

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

/-- The Grundy value of the twin spider S(1, 1, z) in the Game of Arrows equals z % 2 for all 1 ≤ z ≤ 5. -/theorem spider_grundy_val_one_one_up_to_five (z : ℕ) (h1 : 1 ≤ z) (h5 : z ≤ 5) :    spider_grundy_val 1 1 z = z % 2 := by  interval_cases z <;> decide
See it in the graphDiscuss this resultChallenge it