proposition: Fact jump_spec' v w : v = w -> (i,jump) // (i,v) ->> (j,w).
proof: Proof. intros; apply sss_progress_compute, jump_spec; auto. Qed.
imports: List Arith Lia Bool Undecidability.Synthetic(ReducibilityFacts) Undecidability.Shared.Libs.DLW(utils list_bool pos vec subcode sss compiler_correction) Undecidability.StackMachines.BSM(bsm_defs) Undecidability.TM(SBTM pctm_defs)