proposition: Lemma FPower_domain : forall x, Dom F x -> Dom G x -> (forall Hx, [0] [<] F x Hx) -> Dom FPower x.
proof: Proof. intros x H H0 H1. simpl in |- *. cut (Conj (Dom G) (fun y : IR => {Hx : _ | [0] [<] Part F y Hx}) x). intro H2. exists H2; split. split; auto. exists H; auto. Qed.
imports: CoRN.transc.Exponential