rotF_shift_spec (KFC: the Lemma 10 controlled shift (`u = 1`) with the fine-cost rotation)

The following holds (Lean statement, in the scope of module Solutions.KFCShift):

theorem NLogN.KFC.rotF_shift_spec [NeZero Q] (i : Fin n) (c : Fin n → ZMod Q)
    (hc : ∀ j, i ≤ j → c j = 0) (A C : Shape) (hsh : sh = A ++ Q :: C)
    (hA : (Λ.pos i : ℕ) = A.length) (t : IState HS) (xs : List ℤ) (w : ℕ)
    (R L1 L2 L4 L14 : List Item)
    (hlen : xs.length = AModel.vol sh) (hb : Bnd w xs)
    (h0 : t.G 0 = ints xs ++ R) (h1 : t.G 1 = .int (AModel.vol A) :: L1) (h2 : t.G 2 = .int Q :: L2)
    (h4 : t.G 4 = .int (AModel.vol C) :: L4)
    (h14 : t.G 14 = ints ((List.range (AModel.vol A)).map fun p => (KIL.offs Λ c A p : ℤ)) ++ L14) :
    IRuns I iprog rotF t ((t.upd 0 (ints (shiftArr Λ i 1 c 0 xs) ++ R)).upd 14 L14)
      (NLogN.KFC.cRotF (AModel.vol A) Q (AModel.vol C) w)

Context. The lemma belongs to the part KFC: the Lemma 10 controlled shift (u = 1) with the fine-cost rotation: rotF_shift_spec: rotF with the offset table offs Λ c A on stack 14 computes shiftArr Λ i 1 c 0 xs (same denotation as KIL.rotP_shift_spec), cost cRotF.

Formalization Note. This lemma belongs to the item-language (IL) layer of the integer-multiplication-kappa campaign: tape-level programs (register programs over 64 item stacks of the NLogN multitape framework, definition bundles IntMul_HvdH_M_Defs1–IntMul_HvdH_M_Defs8) that implement the data-movement primitives of the OpenAI preprint Integer multiplication below $n\log n$ (field moves, row split/merge, shifts, the uniform Proposition 11 interchange, Lemma 12 with fine $O(1)$-per-element costs, Gaussian record primitives, Proposition 14 pieces) with exact list denotations from the array-model bundles IntMul_Kappa_K_Defs* and explicit cost bounds. All names refer to the definition bundles up to IntMul_Kappa_K_Defs18.