induction 1; inversion 1; intuition; subst; trivial.
Qed.

Lemma dat_correct_h_repeat_app : forall (A : Set) t (c : Comp A)(P : A -> bool) n ls1 ls2 a,
evalDet_steps (cs_more c ls1) (cs_done a nil) ->
P a = false ->
dat_correct_h (Repeat c P) (ls1 ++ ls2) n t ->
dat_correct_h (Repeat c P) ls2 n t.