intuition.
destruct H.
intuition.
exists x.
intuition.
eapply comp_spec_eq_impl_eq in H0; intuition.
rewrite <- H0.
trivial.
Qed.

Theorem comp_spec_seq_eq :
forall (A B C : Set){eqda : EqDec A}{eqdb : EqDec B}{eqdc : EqDec C}(c1 c2 : Comp A)(f1 : A -> Comp B)(f2 : A -> Comp C) P (b : B) (c : C),
comp_spec eq c1 c2 ->
(forall a, comp_spec P (f1 a) (f2 a)) ->
comp_spec P (Bind c1 f1) (Bind c2 f2).