proposition: Lemma Exp_cancel_less : forall x y, Exp x [<] Exp y -> x [<] y.
proof: Proof. intros x y H. astepl (Log (Exp x) (Exp_pos x)). astepr (Log (Exp y) (Exp_pos y)). apply Log_resp_less; auto. Qed.
imports: CoRN.transc.TaylorSeries