proposition: Theorem evalDet_func : forall (A : Set)(c : Comp A)(s : Blist)(y1 y2 : comp_answer A), evalDet c s y1 -> evalDet c s y2 -> y1 = y2.
proof: Proof. intuition. inversion H; subst; clear H. inversion H0; subst; clear H0. f_equal. eapply evalDet_steps_done_func; eauto. exfalso. eapply evalDet_steps_done_eof_func; eauto. inversion H0; clear H0; subst. exfalso. eapply evalDet_steps_done_eof_func; eauto. trivial. Qed.
imports: FCF.Comp FCF.Blist FCF.Fold Permutation micromega.Lia