proposition: Lemma pos_left_right {n m} p q : @pos_right n m q <> @pos_left n m p.
proof: Proof. induction n; cbn. - inversion p. - eapply (Fin.caseS' p). + cbn. congruence. + cbn. intros ? ? % pos_nxt_inj. firstorder. Qed.
imports: Undecidability.StackMachines.BSM Undecidability.StackMachines.Util.BSM_computable Undecidability.TM.TM Undecidability.TM.Util.TM_facts Undecidability.TM.Util.TM_computable Undecidability.TM(TM Arbitrary_to_Binary mTM_to_TM HaltTM_1_to_HaltKOSBTM HaltKOSBTM_to_HaltBSM) Undecidability.Shared.Libs.DLW(vec pos sss subcode) Undecidability(bsm_utils bsm_defs) Undecidability.TM.Code.Code Undecidability.TM(Single.EncodeTapes)