proposition: Lemma vec_list_cast {X n} (v :Vector.t X n) m (E : n = m) : vec_list (cast v E) = vec_list v.
proof: Proof. destruct E. now rewrite cast_eq_refl. 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)