proposition: Theorem F_phi_continuous : forall (A : Type) t f, continuous (f_order A A)(f_order A A) (F_phi A t f).
proof: Proof. intros A t f; unfold F_phi; apply ifthenelse_continuous with (F:= comp_right f) (G:= fun (g:A->option A)(x:A) => Some x). apply comp_right_continuous. apply continuous_cst; auto. Qed.
imports: Relations ClassicalEpsilon function_cpo constructs syntax little