diff options
| author | letouzey | 2006-05-14 09:40:41 +0000 |
|---|---|---|
| committer | letouzey | 2006-05-14 09:40:41 +0000 |
| commit | 7152705f09c6280143d821e46e3bd57522a4a070 (patch) | |
| tree | 575d80cf4966d1fb08a1d4a20ac43b06c258d600 /theories/ZArith/Znumtheory.v | |
| parent | ca2a40d5a9ab1daf0ff1fdd5eed0860c671e2da4 (diff) | |
On remet plutot l'ancien nom Zgcd_is_pos au lieu de Zgcd_pos
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8817 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/ZArith/Znumtheory.v')
| -rw-r--r-- | theories/ZArith/Znumtheory.v | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/theories/ZArith/Znumtheory.v b/theories/ZArith/Znumtheory.v index 5c0ed2ec0e..264c641ac0 100644 --- a/theories/ZArith/Znumtheory.v +++ b/theories/ZArith/Znumtheory.v @@ -421,7 +421,7 @@ Definition Zgcd a b := Zgcdn (Zgcd_bound a) a b. (** A first obvious fact : [Zgcd a b] is positive. *) -Lemma Zgcdn_pos : forall n a b, +Lemma Zgcdn_is_pos : forall n a b, 0 <= Zgcdn n a b. Proof. induction n. @@ -429,9 +429,9 @@ simpl; auto with zarith. destruct a; simpl; intros; auto with zarith; auto. Qed. -Lemma Zgcd_pos : forall a b, 0 <= Zgcd a b. +Lemma Zgcd_is_pos : forall a b, 0 <= Zgcd a b. Proof. -intros; unfold Zgcd; apply Zgcdn_pos; auto. +intros; unfold Zgcd; apply Zgcdn_is_pos; auto. Qed. (** We now prove that Zgcd is indeed a gcd. *) |