AFTD Auto-Formalizing Theoretical Domains

spider_two_leg_blocked_incoming_base

theoremverified

The closed form holds at r = 0 and r = 1: spider_gamma 2 incoming [(0,inward),(1,free)] = 1, spider_gamma 2 incoming [(0,outward),(1,free)] = 1, spider_gamma 3 incoming [(1,inward),(1,free)] = 2 and spider_gamma 3 incoming [(1,outward),(1,free)] = 0, matching spider_blocked_val in each case.

Statement

theorem spider_two_leg_blocked_incoming_base :
    spider_gamma 2 CentreStatus.incoming [(0, SpiderLegEnd.inward), (1, SpiderLegEnd.free)]
        = spider_blocked_val SpiderLegEnd.inward 0 ∧
    spider_gamma 2 CentreStatus.incoming [(0, SpiderLegEnd.outward), (1, SpiderLegEnd.free)]
        = spider_blocked_val SpiderLegEnd.outward 0 ∧
    spider_gamma 3 CentreStatus.incoming [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.free)]
        = spider_blocked_val SpiderLegEnd.inward 1 ∧
    spider_gamma 3 CentreStatus.incoming [(1, SpiderLegEnd.outward), (1, SpiderLegEnd.free)]
        = spider_blocked_val SpiderLegEnd.outward 1
Source
step towards spider_two_leg_blocked_incoming_val
Verified
20 Oct 2026
Axioms
Quot.soundpropext
Built on 4
  • spider_blocked_valThe conjectured closed form of the blocked two-leg family at incoming centre: for end condition inward it is m - 1 when m % 4 = 3 and m +…
  • 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…
  • CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…

The proof, explained

The theorem asserts that the recursive game value `spider_gamma` coincides with the closed form `spider_blocked_val` in the base cases $r = 0$ and $r = 1$, for both inward and outward leg-end configurations. Because all parameters and game configurations are concrete constants, both sides of each of the four equations evaluate definitionally to identical natural numbers (specifically, 1, 1, 2, and 0). The quadruple conjunction is therefore established entirely by reflexivity (`rfl`).

  1. The recursive game values `spider_gamma` match the closed-form values `spider_blocked_val` across all four base cases.

    The theorem requires verifying four equalities: for leg length $r = 0$ with an inward end (both sides compute to $1$), $r = 0$ with an outward end (both evaluate to $1$), $r = 1$ with an inward end (both evaluate to $2$), and $r = 1$ with an outward end (both evaluate to $0$). Because every definition involved is computable and evaluated on explicit constants, both sides of each equality reduce definitionally to the same natural number. The goal is a four-way conjunction $\bigwedge_{i=1}^4 (L_i = R_i)$, which is constructed by bundling four instances of reflexivity (`rfl`).

    line 11

    uses rfl

      ⟨rfl, rfl, rfl, rfl⟩
rfl
Reflexivity of equality: any expression is equal to itself, provided both sides evaluate to the exact same value definitionally.

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

/-- Base cases r = 0 and r = 1 of the blocked two-leg closed form, for both end conditions. -/theorem spider_two_leg_blocked_incoming_base :    spider_gamma 2 CentreStatus.incoming [(0, SpiderLegEnd.inward), (1, SpiderLegEnd.free)]        = spider_blocked_val SpiderLegEnd.inward 0 ∧    spider_gamma 2 CentreStatus.incoming [(0, SpiderLegEnd.outward), (1, SpiderLegEnd.free)]        = spider_blocked_val SpiderLegEnd.outward 0 ∧    spider_gamma 3 CentreStatus.incoming [(1, SpiderLegEnd.inward), (1, SpiderLegEnd.free)]        = spider_blocked_val SpiderLegEnd.inward 1 ∧    spider_gamma 3 CentreStatus.incoming [(1, SpiderLegEnd.outward), (1, SpiderLegEnd.free)]        = spider_blocked_val SpiderLegEnd.outward 1 :=  ⟨rfl, rfl, rfl, rfl⟩
See it in the graphDiscuss this resultChallenge it