proposition: Lemma vec_change_F1' n v w {m m' : nat} : vec_change (vec_app (n ## v) (vec_app w (m ## vec_nil))) F1' m' = vec_app (n ## v) (vec_app w (m' ## vec_nil)).
proof: Proof. by rewrite !vec_change_app_right. 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