AFTD Auto-Formalizing Theoretical Domains

prioritized_borel_fork_stay_consistent

theoremverified

A stay block is consistent with every p-owned choice function.

Statement

theorem prioritized_borel_fork_stay_consistent (choice : List PrioritizedBorelForkEdge → Bool)
    (pre : List PrioritizedBorelForkEdge) (b : Bool) :
    prioritized_borel_fork_consistent choice pre (prioritized_borel_fork_three_step_block b false)
Source
arXiv:2611.10136, Section 5.3.2; the three-state fork subarena
Verified
12 Nov 2026
Axioms
propext
Built on 3
Used by 1

The proof, explained

The proof proceeds by case analysis on the boolean flag b. In both cases, every edge in a stay block (where exit is false) has source vertex 0, whereas consistency only constrains edges originating at vertex 2. The consistency condition is therefore vacuously satisfied for all edges in the block, so unfolding the definitions reduces the goal to true.

  1. The stay block prioritized_borel_fork_three_step_block b false is consistent with the choice function choice given prefix pre.

    We case-split on the boolean b. In both cases (b = false and b = true), prioritized_borel_fork_three_step_block b false produces a three-edge block where every edge has source vertex 0. The definition of prioritized_borel_fork_consistent requires an edge's direction to match choice pre only when the edge has source vertex 2. Since 0 = 2 is false, this condition is vacuously satisfied for all three edges, and the empty-list base case is trivially true. Simplifying with both definitions unfolds the block and evaluates all conditions to true, closing both branches.

    line 4

    uses prioritized_borel_fork_three_step_block, prioritized_borel_fork_consistent

      cases b <;> simp [prioritized_borel_fork_three_step_block, prioritized_borel_fork_consistent]
prioritized_borel_fork_three_step_block
Defines a three-step sequence of edges parametrized by a direction bit b and an exit flag; when the exit flag is false (a stay block), all three edges have source and target vertex 0.
prioritized_borel_fork_consistent
States that an edge sequence is consistent with a choice function, requiring that any edge originating at vertex 2 has its direction determined by the choice function on the preceding edge history.

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

theorem prioritized_borel_fork_stay_consistent (choice : List PrioritizedBorelForkEdge → Bool)    (pre : List PrioritizedBorelForkEdge) (b : Bool) :    prioritized_borel_fork_consistent choice pre (prioritized_borel_fork_three_step_block b false) := by  cases b <;> simp [prioritized_borel_fork_three_step_block, prioritized_borel_fork_consistent]
See it in the graphDiscuss this resultChallenge it