proposition: Lemma evalDet_steps_nil_eq : forall (A : Set)(c : Comp A)(a1 a2 : A) s2, evalDet_steps (cs_more c nil) (cs_done a2 s2) -> In a1 (getSupport c) -> a1 = a2.
proof: Proof. intuition. eapply evalDet_steps_nil_eq_h; eauto. Qed.
imports: FCF.Comp FCF.Blist FCF.Fold Permutation micromega.Lia