AFTD Auto-Formalizing Theoretical Domains

PrioritizedBorelForkRun

inductive

A finite path in the fork arena whose edges are legal and have matching endpoints.

Statement

inductive PrioritizedBorelForkRun : Fin 3 → List PrioritizedBorelForkEdge → Fin 3 → Prop
  | nil (q : Fin 3) : PrioritizedBorelForkRun q [] q
  | cons {q s : Fin 3} {e : PrioritizedBorelForkEdge} {es : List PrioritizedBorelForkEdge} :
      prioritized_borel_fork_is_legal e → e.src = q → PrioritizedBorelForkRun e.dst es s →
      PrioritizedBorelForkRun q (e :: es) s
Source
arXiv:2611.10136, Section 5.3.2; the three-state fork subarena
Verified
12 Nov 2026
Axioms
none listed
Built on 2
Used by 7

Lean source view module on GitHub

inductive PrioritizedBorelForkRun : Fin 3 → List PrioritizedBorelForkEdge → Fin 3 → Prop
  | nil (q : Fin 3) : PrioritizedBorelForkRun q [] q
  | cons {q s : Fin 3} {e : PrioritizedBorelForkEdge} {es : List PrioritizedBorelForkEdge} :
      prioritized_borel_fork_is_legal e → e.src = q → PrioritizedBorelForkRun e.dst es s →
      PrioritizedBorelForkRun q (e :: es) s
See it in the graphDiscuss this resultChallenge it