proposition: Theorem continuous_cst : forall (A B:Type)(R:A->A->Prop)(R':B->B->Prop)(b:B), reflexive R' -> continuous R R' (fun x:A => b).
proof: Proof. intros A B R R' b Hrefl c Hch l Hlub. apply lub_cst; auto. Qed.
imports: Relations Classical ClassicalEpsilon Zwf function_cpo