From Undecidability.TM Require Hoare.
Local Arguments skipn { A } !n !l.
Local Arguments plus : simpl never.
Local Arguments mult : simpl never.
Local Arguments Encode_list : simpl never.
Local Arguments Encode_nat : simpl never.
Set Default Proof Using "Type".

(* TODO: -> base *)
Lemma map_removelast (A B : Type) (f : A -> B) (l : list A) :
map f (removelast l) = removelast (map f l).