proposition: Lemma sc_firstn {X : Type} i (P Q : list X) : P = firstn (length P) Q -> (i, P) <sc (i, Q).
proof: Proof. intros ->. exists nil, (skipn (length P) Q). split. - now rewrite firstn_skipn. - cbn. lia. 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)