spider_blocked_two_three_level_five_sub_long_leg_j34_inward
With free centre, the state whose legs are a length-2 leg with far end inward, the (5,inward) leg, and the free leg 2 has Grundy value 0 at fuel 10.
Statement
theorem spider_blocked_two_three_level_five_sub_long_leg_j34_inward :
spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0- Source
- step towards spider_blocked_two_three_level_five_sub_long_leg_j34
- Verified
- 20 Oct 2026
- Axioms
Quot.soundpropext- Built on 3
- CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
- SpiderLegEndThe end condition of an attached leg in a spider state is either free (no arc on the leg), inward (pointing towards the centre), or…
- spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
- Used by 1
- spider_blocked_two_three_level_five_sub_long_leg_j34With free centre, the state obtained from (none;{(5,inward),2^*,3^*}) by cutting the (5,inward) leg at j = 4 leaves a leg of length 2 with…
The proof, explained
The theorem asserts that a spider game position with three legs—a length-2 leg with inward orientation, a length-5 leg with inward orientation, and an unconstrained length-2 leg—has Grundy value 0 when evaluated with a search depth of 10. Because the state space and the recursive rules defining `spider_gamma` are finite and computable, the entire equality is verified by direct computational reduction via the `decide` tactic.
`spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0` automation
Because all inputs are concrete constants and the functions `spider_gamma`, `spider_rho`, `spider_update_centre`, and `nat_mex_list` are fully computable, the equality is decidable. The `decide` tactic evaluates the recursive game-tree exploration and mex calculation directly, confirming that the resulting Grundy value is 0.
decide
- The proof relies entirely on Lean's kernel computation (`decide`) evaluating the recursive definition of `spider_gamma` on concrete inputs; there are no intermediate lemma-based steps.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Value 0 at fuel 10 for the state (none; {(2,inward), (5,inward), 2^*}). -/theorem spider_blocked_two_three_level_five_sub_long_leg_j34_inward : spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0 := by decide