intros p; elim (BinPos.nat_of_P p); simpl in |- *; auto; intros n0 H';
rewrite H'; ring.
intros p; elim (BinPos.nat_of_P p); simpl in |- *.
exact Rinv_1.
intros n1 H'; rewrite Rinv_mult_distr; try rewrite Rinv_1; try rewrite H';
auto with real.
Qed.

Theorem Rle_powerRZ :
forall (e : R) (n m : BinInt.Z),
(1 <= e)%R -> (n <= m)%Z -> (powerRZ e n <= powerRZ e m)%R.