proposition: Theorem fcf_spec_seq : forall {A B : Set} (P' : A -> B -> Prop) {C D : Set} P{eqda : EqDec A}{eqdb : EqDec B}{eqdc : EqDec C}{eqdd : EqDec D}(c1 : Comp A)(c2 : Comp B) (c : C) (d : D) (f1 : A -> Comp C)(f2 : B -> Comp D), comp_spec P' c1 c2 -> (forall a b, In a (getSupport c1) -> In b (getSupport c2) -> P' a b -> comp_spec P (f1 a) (f2 b)) -> comp_spec P (Bind c1 f1) (Bind c2 f2).
proof: Proof. intuition. eapply comp_spec_seq; intuition; eauto. Qed.
imports: FCF.Crypto FCF.DistTacs FCF.ProgTacs FCF.GenTacs FCF.ProgramLogic