proposition: Lemma evalDet_steps_done_nil_inv : forall (A : Set)(c : Comp A) a ls, evalDet_steps (cs_more c nil) (cs_done a ls) -> ls = nil.
proof: Proof. intuition. eapply evalDet_steps_done_nil_inv_h; eauto. Qed.
imports: FCF.Comp FCF.Blist FCF.Fold Permutation micromega.Lia