diff options
| author | letouzey | 2010-12-17 21:00:26 +0000 |
|---|---|---|
| committer | letouzey | 2010-12-17 21:00:26 +0000 |
| commit | e1cad068ffc188d06c37f46e1bf6e7b57e02e219 (patch) | |
| tree | 7d9f6b7051b21d3fd1fde1a257bdf1562b15729f /theories/Numbers/Integer/Abstract | |
| parent | b1040ad095410fe925b0a3aaf9399776279486f0 (diff) | |
Cosmetic : let's take advantage of the n-ary exists notation
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@13721 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Numbers/Integer/Abstract')
| -rw-r--r-- | theories/Numbers/Integer/Abstract/ZGcd.v | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/theories/Numbers/Integer/Abstract/ZGcd.v b/theories/Numbers/Integer/Abstract/ZGcd.v index 8e128215d9..77a7c73415 100644 --- a/theories/Numbers/Integer/Abstract/ZGcd.v +++ b/theories/Numbers/Integer/Abstract/ZGcd.v @@ -141,7 +141,7 @@ Proof. rewrite <- add_opp_r, <- mul_opp_l. apply gcd_add_mult_diag_r. Qed. -Definition Bezout n m p := exists a, exists b, a*n + b*m == p. +Definition Bezout n m p := exists a b, a*n + b*m == p. Instance Bezout_wd : Proper (eq==>eq==>eq==>iff) Bezout. Proof. @@ -250,7 +250,7 @@ Proof. Qed. Lemma divide_mul_split : forall n m p, n ~= 0 -> (n | m * p) -> - exists q, exists r, n == q*r /\ (q | m) /\ (r | p). + exists q r, n == q*r /\ (q | m) /\ (r | p). Proof. intros n m p Hn H. assert (G := gcd_nonneg n m). |