spider_blocked_two_three_level_five_sub_long_leg_j34_outward
With free centre, the state whose legs are a length-2 leg with far end outward, the (5,inward) leg, and the free leg 2 has Grundy value 1 at fuel 10.
Statement
theorem spider_blocked_two_three_level_five_sub_long_leg_j34_outward :
spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1- 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 specific three-legged spider configuration—having centre status `none` and legs `(2, outward)`, `(5, inward)`, and `(2, free)`—has Grundy value 1 with fuel 10. Because the game rules and the nim-value function `spider_gamma` are completely computable on concrete data, the proof proceeds entirely by direct evaluation using the `decide` tactic.
The Grundy value of the spider game state with centre status `none` and legs `(2, outward)`, `(5, inward)`, and `(2, free)` at fuel 10 is 1. automation
The function `spider_gamma` is fully computable, and all its arguments are concrete finite values. The `decide` tactic evaluates the recursive game transitions, computes the Grundy values of all subpositions, and verifies by direct computation that the resulting value is 1.
decide
- The proof relies entirely on computational evaluation (`decide`): Lean evaluates the recursive definition of `spider_gamma` on concrete inputs by finite game-tree exploration and verifies that the Grundy value equals 1.
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 1 at fuel 10 for the state (none; {(2,outward), (5,inward), 2^*}). -/theorem spider_blocked_two_three_level_five_sub_long_leg_j34_outward : spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1 := by decide