proposition: Lemma shift_addr_range i : 1 <= i < S (S (length P)) -> shift_addr i = i.
proof: Proof. move: i => [|i] ? /=; [lia|]. by have -> : S (length P) - i = S (length P - i) by lia. Qed.
imports: Undecidability(TM.TM) Undecidability.MinskyMachines(MM MMA MMA.mma_defs Util.MMA_computable) Undecidability.Shared.Libs.DLW(Vec.pos Vec.vec Code.sss) List PeanoNat Lia Relations ssreflect