proposition: Lemma evalDet_steps_done_nil_inv_h : forall (A : Set)(x y : comp_state A), evalDet_steps x y -> forall (c : Comp A) a ls, x = (cs_more c nil) -> y = (cs_done a ls) -> ls = nil.
proof: Proof. induction 1; intuition; subst. discriminate. inversion H1; clear H1; subst. inversion H0; clear H0; subst. eapply evalDet_step_done_nil_inv; eauto. assert (s = nil). eapply evalDet_step_more_nil_inv; eauto. subst. eauto. Qed.
imports: FCF.Comp FCF.Blist FCF.Fold Permutation micromega.Lia