proposition: Theorem evalDet_steps_bind_more : forall(A B : Set)(c1 : Comp B)(c2 : B -> Comp A) s c1' s', evalDet_steps (cs_more c1 s) (cs_more c1' s') -> evalDet_steps (cs_more (Bind c1 c2) s) (cs_more (Bind c1' c2) s').
proof: Proof. intuition. eapply evalDet_steps_bind_more_h; eauto. Qed.
imports: FCF.Comp FCF.Blist FCF.Fold Permutation micromega.Lia