Proof with eauto with val_erasure.
intros.
destruct v1; inv H; simpl...
destruct q; simpl; unfold inj_value; simpl;
repeat (econstructor; simpl; auto).
Qed.

Lemma repeat_Undef_erasure_self :
forall (n : nat),
memval_erasure_list (list_repeat n Undef) (list_repeat n Undef).