HvdH machine lemma AX.bapSl_all (One resampling axis, part 5: the `bapL` slice program as a `GL.LProg`)

The following holds (Lean statement, in the scope of module NLogN.HAx5):

theorem NLogN.AX.bapSl_all (M : MulSpec) (p s t α kb Bi Bo mm Φ Bacc Q : ℕ) (hM : MulBnd M mm Φ)
    (H : BapHyp p s t α kb Bi Bo mm Bacc Q) (st : IState HS) (x : List (ℤ × ℤ)) (R : List Item)
    (hC : CtxB p s t α kb st) (hx : x.length = t ∧ GB Bi x) (hI : st.G bI = gints x ++ R) :
    bapSlP.run st = (st.upd bI R).upd bO (gints (bapL p s t α x) ++ st.G bO) ∧
      bapSlP.ok M st ∧ bapSlP.cost M st ≤ bapSlC p s t α kb mm Φ Bacc Q

Context. The lemma belongs to the part One resampling axis, part 5: the bapL slice program as a GL.LProg.

Formalization Note. This is a lemma of the Lean development NLogN, a multitape-Turing-machine implementation of the Harvey–van der Hoeven $O(n\log n)$ integer multiplication algorithm, used in the proof of NLogN.FIN.theorem_1_1_nlogn : IntMul.MulTimeBound fun n => n * Real.log n. All names refer to the definition bundles IntMul_HvdH_M_Defs1–IntMul_HvdH_M_Defs8 (namespace NLogN), built on the platform model Def_IntMul_MultitapeModel and the published reference Def_IntMul_HvdH_MachineRef. The machine layer: IState HS is a state of 64 item stacks; RM programs have a semantics p.run s, a definedness predicate p.ok M s and a cost p.cost M s relative to a multiplication spec M : MulSpec; zsz z is the bit length of $|z|$.