diff options
author | barras <barras@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2003-12-24 10:27:08 +0000 |
---|---|---|
committer | barras <barras@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2003-12-24 10:27:08 +0000 |
commit | 38734c5e122e9a38cf5b8afc586f47abced11361 (patch) | |
tree | 2227afa958bf809d9152b526e29f183b552e5e61 /theories/Reals/Alembert.v | |
parent | c69ae2a1f05db124c19b7f326ca23e980f643198 (diff) |
changement de pose en set (pose n'etait pas utilise avec la semantique
documentee).
Reste a retablir la semantique de pose.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@5141 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Reals/Alembert.v')
-rw-r--r-- | theories/Reals/Alembert.v | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/theories/Reals/Alembert.v b/theories/Reals/Alembert.v index 7d8a93914..396029c03 100644 --- a/theories/Reals/Alembert.v +++ b/theories/Reals/Alembert.v @@ -121,8 +121,8 @@ Lemma Alembert_C2 : Un_cv (fun n:nat => Rabs (An (S n) / An n)) 0 -> sigT (fun l:R => Un_cv (fun N:nat => sum_f_R0 An N) l). intros. -pose (Vn := fun i:nat => (2 * Rabs (An i) + An i) / 2). -pose (Wn := fun i:nat => (2 * Rabs (An i) - An i) / 2). +set (Vn := fun i:nat => (2 * Rabs (An i) + An i) / 2). +set (Wn := fun i:nat => (2 * Rabs (An i) - An i) / 2). cut (forall n:nat, 0 < Vn n). intro; cut (forall n:nat, 0 < Wn n). intro; cut (Un_cv (fun n:nat => Rabs (Vn (S n) / Vn n)) 0). @@ -135,7 +135,7 @@ apply existT with (x - x0); unfold Un_cv in |- *; unfold Un_cv in p; unfold Un_cv in p0; intros; cut (0 < eps / 2). intro; elim (p (eps / 2) H8); clear p; intros. elim (p0 (eps / 2) H8); clear p0; intros. -pose (N := max x1 x2). +set (N := max x1 x2). exists N; intros; replace (sum_f_R0 An n) with (sum_f_R0 Vn n - sum_f_R0 Wn n). unfold R_dist in |- *; @@ -340,7 +340,7 @@ Lemma AlembertC3_step1 : (forall n:nat, An n <> 0) -> Un_cv (fun n:nat => Rabs (An (S n) / An n)) 0 -> sigT (fun l:R => Pser An x l). -intros; pose (Bn := fun i:nat => An i * x ^ i). +intros; set (Bn := fun i:nat => An i * x ^ i). cut (forall n:nat, Bn n <> 0). intro; cut (Un_cv (fun n:nat => Rabs (Bn (S n) / Bn n)) 0). intro; assert (H4 := Alembert_C2 Bn H2 H3). |