spider_none_one_inward_one_outward_opts_mex
For r ≥ 2 and φ ≠ free, the mex of the explicit option list of the κ₁ configuration equals r.
Statement
theorem spider_none_one_inward_one_outward_opts_mex (r : ℕ) (hr : 2 ≤ r) (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) :
nat_mex_list (spider_none_one_inward_one_outward_opts r φ) = r- Source
- step towards spider_blocked_none_one_inward_one_outward
- Verified
- 20 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- spider_none_one_inward_one_outward_opts_not_memFor r ≥ 2 and φ ≠ free, the level r is not a member of the closed-form option list of the κ₁ family.
- spider_none_one_inward_one_outward_opts_all_lt_memFor r ≥ 2 and φ ≠ free, every k < r is a member of the closed-form option list of the κ₁ family.
- nat_mex_list_not_mem_and_ltFor a list l of naturals, nat_mex_list l is not a member of l, and every natural number below nat_mex_list l is a member of l.
- spider_mex_list_eq_of_not_mem_and_lt_memIf a natural number m is absent from a list l of naturals and every k < m is present in l, then the mex of l is m.
- 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_none_one_inward_one_outward_optsThe explicit closed-form option list of the state (none;{(1,inward),(1,outward),(r,φ)}) after substituting the sub-state values: the two…
- nat_mex_listThe minimum excluded value (mex) of a finite list of natural numbers is the least non-negative integer not in the list.
- Used by 1
- spider_blocked_none_one_inward_one_outwardFor the configuration κ₁ = (none;{(1,inward),(1,outward)}), the blocked family V^φ_κ₁(r) equals r for every r ≥ 1 and both φ.
The proof, explained
To determine that the minimum excluded value (mex) of the option list for the $\kappa_1$ spider configuration is $r$, the proof applies the standard characterization of the mex: showing that $r$ does not belong to the list while all natural numbers strictly smaller than $r$ do. These two conditions are supplied directly by two previously established helper lemmas.
The mex of the option list `spider_none_one_inward_one_outward_opts r φ` is $r$.
The minimum excluded value (mex) of a list is $r$ if $r$ is omitted from the list and every $k < r$ appears in it (`spider_mex_list_eq_of_not_mem_and_lt_mem`). The first requirement is provided by `spider_none_one_inward_one_outward_opts_not_mem`, and the second requirement is provided by `spider_none_one_inward_one_outward_opts_all_lt_mem`.
uses
spider_mex_list_eq_of_not_mem_and_lt_mem,spider_none_one_inward_one_outward_opts_not_mem,spider_none_one_inward_one_outward_opts_all_lt_memnat_mex_list (spider_none_one_inward_one_outward_opts r φ) = r := spider_mex_list_eq_of_not_mem_and_lt_mem _ _ (spider_none_one_inward_one_outward_opts_not_mem r hr φ hφ) (spider_none_one_inward_one_outward_opts_all_lt_mem r hr φ hφ)
spider_mex_list_eq_of_not_mem_and_lt_mem- If a natural number $m$ is not in a list $l$, and every natural number $k < m$ is in $l$, then the mex of $l$ is $m$.
spider_none_one_inward_one_outward_opts_not_mem- For $r \ge 2$ and $\phi \neq \text{free}$, the value $r$ is not an element of the option list of the $\kappa_1$ configuration.
spider_none_one_inward_one_outward_opts_all_lt_mem- For $r \ge 2$ and $\phi \neq \text{free}$, every natural number $k < r$ is an element of the option list of the $\kappa_1$ configuration.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The mex of the closed-form option list of the κ₁ family equals r. -/theorem spider_none_one_inward_one_outward_opts_mex (r : ℕ) (hr : 2 ≤ r) (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) : nat_mex_list (spider_none_one_inward_one_outward_opts r φ) = r := spider_mex_list_eq_of_not_mem_and_lt_mem _ _ (spider_none_one_inward_one_outward_opts_not_mem r hr φ hφ) (spider_none_one_inward_one_outward_opts_all_lt_mem r hr φ hφ)