proposition: Lemma tmp_reg p q : tmp p <> reg q.
proof: Proof. cbn. intros H % pos_nxt_inj. eapply pos_right_left. now rewrite H. Qed.
imports: Undecidability.MinskyMachines(MM_computable MM_sss mm_utils) Undecidability.StackMachines(BSM_computable) Undecidability.Shared.Libs.DLW(vec pos sss subcode) Lia Vector Nat Arith List Undecidability.MinskyMachines.MM(mm_defs mm_utils mm_comp_strong)