spider_blocked_raw_opts_split
The raw option list of (in;{(r,β),(1,free)}) decomposes as spider_blocked_leg0_opts r β ++ spider_blocked_free_leg_opts r β: the zipIdx over the two legs splits into the leg (r,β) (whose rest is [(1,free)]) and the leg (1,free) (whose rest is [(r,β)]), and in that order.
Statement
theorem spider_blocked_raw_opts_split (r : ℕ) (beta : SpiderLegEnd) :
spider_blocked_raw_opts r beta
= spider_blocked_leg0_opts r beta ++ spider_blocked_free_leg_opts r beta- Source
- step towards op211_three_legged_spider_eventual_parity
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- spider_blocked_raw_optsThe raw option list of the state (in;{(r,β),(1,free)}) after exactly one unfolding step of spider_gamma at fuel r+2, with the *sub-state…
- spider_blocked_leg0_optsThe contribution of the blocked leg (r,β) alone to the raw option list of (in;{(r,β),(1,free)}): for each cut j₀ = 0,…,r-1 of that leg,…
- spider_blocked_free_leg_optsThe contribution of the free leg (1,free) alone to the raw option list of (in;{(r,β),(1,free)}): the unique cut j = 1 with direction δ…
- CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
- spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
- 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_rhoThe function spider_rho takes h : ℕ and delta, phi : SpiderLegEnd, returning h if phi = free; if phi = inward, it returns h % 2 when delta…
- spider_update_centreThe function spider_update_centre updates centre status s given leg transition delta: if delta is inward, none maps to incoming, incoming…
- spider_blocked_optionvals_leFor r ≥ 2 and β ≠ free, every element of the explicit options list of (in;{(r,β),(1,free)}) is at most r.
The proof, explained
The raw option list for the two-legged configuration `[(r, β), (1, free)]` decomposes into moves on the first leg followed by moves on the second leg. The proof unfolds the definitions of the option lists and simplifies the `flatMap` over the two-element list of legs. The term for index 0 corresponds exactly to `spider_blocked_leg0_opts`, while index 1 simplifies to `spider_blocked_free_leg_opts`, closing the equality by simplification.
spider_blocked_raw_opts r beta = spider_blocked_leg0_opts r beta ++ spider_blocked_free_leg_opts r beta automation
The proof unfolds the definitions of `spider_blocked_raw_opts`, `spider_blocked_leg0_opts`, and `spider_blocked_free_leg_opts`. In `spider_blocked_raw_opts`, the list of legs is the two-element list `[(r, beta), (1, free)]`. Indexing this list produces two items: index 0 (the leg `(r, beta)` with remainder `[(1, free)]`) and index 1 (the leg `(1, free)` with remainder `[(r, beta)]`). The `flatMap` over this two-element list decomposes into the concatenation of the options from index 0 (which matches `spider_blocked_leg0_opts`) and the options from index 1 (which matches `spider_blocked_free_leg_opts`, where the length is 1 so j = 1 and the move cannot exceed length 1). Lean's simplifier evaluates the list operations and closes the goal.
uses
spider_blocked_optionvals_le= spider_blocked_leg0_opts r beta ++ spider_blocked_free_leg_opts r beta := by first | exact spider_blocked_optionvals_le | (apply spider_blocked_optionvals_le <;> assumption) | (apply spider_blocked_optionvals_le <;> simp_all) | simpa using spider_blocked_optionvals_le | (simp only [SpiderLegEnd, spider_blocked_raw_opts, spider_blocked_leg0_opts, spider_blocked_free_leg_opts] at *; first | exact spider_blocked_optionvals_le | (apply spider_blocked_optionvals_le <;> assumption) | (apply spider_blocked_optionvals_le <;> simp_all) | simpa using spider_blocked_optionvals_le)
spider_blocked_optionvals_le- For any leg length r ≥ 2 and end condition β ≠ free, every option value of the blocked spider is at most r.
- The Lean proof was written with a generated search pattern (`first | ...`). While `spider_blocked_optionvals_le` is passed to `simpa`, it is unused in the proof: the goal is solved entirely by definitional simplification of list operations.
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.
/-- The raw option list splits as the blocked leg's options followed by the free leg's options. -/theorem spider_blocked_raw_opts_split (r : ℕ) (beta : SpiderLegEnd) : spider_blocked_raw_opts r beta = spider_blocked_leg0_opts r beta ++ spider_blocked_free_leg_opts r beta := by first | exact spider_blocked_optionvals_le | (apply spider_blocked_optionvals_le <;> assumption) | (apply spider_blocked_optionvals_le <;> simp_all) | simpa using spider_blocked_optionvals_le | (simp only [SpiderLegEnd, spider_blocked_raw_opts, spider_blocked_leg0_opts, spider_blocked_free_leg_opts] at *; first | exact spider_blocked_optionvals_le | (apply spider_blocked_optionvals_le <;> assumption) | (apply spider_blocked_optionvals_le <;> simp_all) | simpa using spider_blocked_optionvals_le)