induction n1 as [|n1 IHn1]; simpl; intros n2 n3 Heq w; intuition.
rewrite (UIP_dec eq_nat_dec Heq (refl_equal _)); reflexivity.
rewrite (IHn1 _ _ (plus_assoc _ _ _)).
f_equal.
apply wtl_match.
Qed.

Lemma wtl_eq_rect : forall n w Heq Heq',
wtl (eq_rect (S n) word w (S (n + 0)) Heq) =
eq_rect n word (wtl w) (n + 0) Heq'.