spider_rho_zero_same
For any non-free spider leg end φ, spider_rho 0 φ φ = 0.
Statement
theorem spider_rho_zero_same (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) :
spider_rho 0 φ φ = 0- Source
- step towards spider_mex_incoming_one_outward
- Verified
- 19 Oct 2026
- Axioms
propext- Built on 2
- 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…
- Used by 6
- spider_blocked_optionvals_not_memFor r ≥ 1 and β inward or outward, the closed-form value spider_blocked_val β r does not occur in the explicit options list of…
- spider_mex_incoming_one_outwardThe minimum excluded value of the explicit options list for the configuration κ₂ = (in;{(1,outward),(r,φ)}) equals r ^^^ 1 for every r ≥ 2…
- spider_mex_incoming_one_outward_not_memThe value r ^^^ 1 is not a member of the explicit options list for (in;{(1,outward),(r,φ)}) when r ≥ 2 and φ ≠ free.
- spider_blocked_none_one_inward_one_outward_opts_eqFor r ≥ 2, φ ≠ free, and assuming the closed form for all smaller levels, the mex of the raw option list equals the mex of the explicit…
- spider_blocked_optionvals_leFor r ≥ 2 and β ≠ free, every element of the explicit options list of (in;{(r,β),(1,free)}) is at most r.
- spider_blocked_none_one_inward_one_outward_raw_opts_eqFor r ≥ 2 and φ ≠ free, the value of (none;{(1,inward),(1,outward),(r,φ)}) at fuel r+3 is the mex of the raw option list…
The proof, explained
The proof argues by case analysis on the spider leg end φ. The case where φ is free is ruled out by the hypothesis that φ ≠ free, and the remaining cases φ = inward and φ = outward follow directly by simplifying the definition of spider_rho at height 0.
The case φ = free cannot occur.
We consider the possible constructors for the spider leg end φ. If φ is free, reflexivity gives φ = free, which directly contradicts the hypothesis hφ that φ ≠ free.
uses
absurd,rflcases φ with | free => exact absurd rfl hφ
When φ = inward, spider_rho 0 inward inward = 0.
Simplifying with the definition of spider_rho: when phi and delta are both inward and the height is 0, the function evaluates to 0 % 2, which is 0.
uses
spider_rho| inward => simp [spider_rho]When φ = outward, spider_rho 0 outward outward = 0.
Similarly, when phi and delta are both outward and the height is 0, the definition of spider_rho evaluates to 0 % 2, which is 0.
uses
spider_rho| outward => simp [spider_rho]
absurd- from a proposition a and its negation ¬a, any goal b follows
rfl- equality is reflexive: any term equals itself
spider_rho- the spider_rho function, computing the leg state based on height and ends
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.
/-- For any non-free spider leg end φ, spider_rho 0 φ φ equals 0. -/theorem spider_rho_zero_same (φ : SpiderLegEnd) (hφ : φ ≠ SpiderLegEnd.free) : spider_rho 0 φ φ = 0 := by cases φ with | free => exact absurd rfl hφ | inward => simp [spider_rho] | outward => simp [spider_rho]