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/Binomial.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/Binomial.v')
-rw-r--r-- | theories/Reals/Binomial.v | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/theories/Reals/Binomial.v b/theories/Reals/Binomial.v index e8173b82e..ad5a358e8 100644 --- a/theories/Reals/Binomial.v +++ b/theories/Reals/Binomial.v @@ -135,7 +135,7 @@ replace (y ^ 0) with 1; [ rewrite Rmult_1_r | simpl in |- *; reflexivity ]. induction n as [| n Hrecn0]. simpl in |- *; do 2 rewrite H; ring. (* N >= 1 *) -pose (N := S n). +set (N := S n). rewrite Rmult_plus_distr_l. replace (sum_f_R0 (fun i:nat => C N i * x ^ i * y ^ (N - i)) N * x) with (sum_f_R0 (fun i:nat => C N i * x ^ S i * y ^ (N - i)) N). @@ -145,8 +145,8 @@ rewrite (decomp_sum (fun i:nat => C (S N) i * x ^ i * y ^ (S N - i)) N). rewrite H; replace (x ^ 0) with 1; [ idtac | reflexivity ]. do 2 rewrite Rmult_1_l. replace (S N - 0)%nat with (S N); [ idtac | reflexivity ]. -pose (An := fun i:nat => C N i * x ^ S i * y ^ (N - i)). -pose (Bn := fun i:nat => C N (S i) * x ^ S i * y ^ (N - i)). +set (An := fun i:nat => C N i * x ^ S i * y ^ (N - i)). +set (Bn := fun i:nat => C N (S i) * x ^ S i * y ^ (N - i)). replace (pred N) with n. replace (sum_f_R0 (fun i:nat => C (S N) (S i) * x ^ S i * y ^ (S N - S i)) n) with (sum_f_R0 (fun i:nat => An i + Bn i) n). @@ -156,7 +156,7 @@ rewrite (Rplus_comm (sum_f_R0 An n)). repeat rewrite Rplus_assoc. rewrite <- tech5. fold N in |- *. -pose (Cn := fun i:nat => C N i * x ^ i * y ^ (S N - i)). +set (Cn := fun i:nat => C N i * x ^ i * y ^ (S N - i)). cut (forall i:nat, (i < N)%nat -> Cn (S i) = Bn i). intro; replace (sum_f_R0 Bn n) with (sum_f_R0 (fun i:nat => Cn (S i)) n). replace (y ^ S N) with (Cn 0%nat). |