proposition: Lemma evalDet_step_nil_inv : forall (A : Set)(c : Comp A)(a1 a2 : A) s2, evalDet_step c nil = (cs_done a2 s2) -> In a1 (getSupport c) -> a1 = a2.
proof: Proof. induction c; intuition; simpl in *; intuition; subst. inversion H; clear H; subst. trivial. destruct (evalDet_step c nil); discriminate. destruct n; try discriminate. discriminate. Qed.
imports: FCF.Comp FCF.Blist FCF.Fold Permutation micromega.Lia