proposition: Lemma sc_offset_asssoc {X : Type} k1 k2 i j (P Q : list X) : ((k1 + k2) + i, P) <sc (j, Q) -> (k1 + (k2 + i), P) <sc (j, Q).
proof: Proof. now rewrite Nat.add_assoc. Qed.
imports: Undecidability.TM.KOSBTM.KOSBTM Undecidability.Shared.Libs.PSL.Vectors.FinNotation Undecidability.Shared.Libs.PSL.Vectors.Vectors Undecidability.Shared.Libs.PSL.EqDec List Arith Lia Bool Undecidability.Shared.Libs.DLW(utils list_bool pos vec subcode sss) Undecidability.StackMachines.BSM(bsm_defs)