Theorem bezout 12059

Description: Bézout's identity: For any integers A and B, there are integers x , y such that ( A gcd B ) = A x. x + B x. y. This is Metamath 100 proof #60.

The proof is constructive, in the sense that it applies the Extended Euclidian Algorithm to constuct a number which can be shown to be ( A gcd B ) and which satisfies the rest of the theorem. In the presence of excluded middle, it is common to prove Bézout's identity by taking the smallest number which satisfies the Bézout condition, and showing it is the greatest common divisor. But we do not have the ability to show that number exists other than by providing a way to determine it. (Contributed by Mario Carneiro, 22-Feb-2014.)

Assertion

Ref	Expression
bezout	|- ( ( A e. ZZ /\ B e. ZZ ) -> E. x e. ZZ E. y e. ZZ ( A gcd B ) = ( ( A x. x ) + ( B x. y ) ) )

Distinct variable groups:   x, A, y   x, B, y

Proof of Theorem bezout

Dummy variables d w z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bezoutlembi 12053	. 2 |- ( ( A e. ZZ /\ B e. ZZ ) -> E. d e. NN0 ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) )
2		simprrr 540	. . 3 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) )
3		nfv 1539	. . . . 5 |- F/ x ( A e. ZZ /\ B e. ZZ )
4		nfv 1539	. . . . . 6 |- F/ x d e. NN0
5		nfv 1539	. . . . . . 7 |- F/ x A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) )
6		nfre1 2533	. . . . . . 7 |- F/ x E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) )
7	5, 6	nfan 1576	. . . . . 6 |- F/ x ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) )
8	4, 7	nfan 1576	. . . . 5 |- F/ x ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) )
9	3, 8	nfan 1576	. . . 4 |- F/ x ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) )
10		nfv 1539	. . . . . 6 |- F/ y ( A e. ZZ /\ B e. ZZ )
11		nfv 1539	. . . . . . 7 |- F/ y d e. NN0
12		nfv 1539	. . . . . . . 8 |- F/ y A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) )
13		nfcv 2332	. . . . . . . . 9 |- F/_ y ZZ
14		nfre1 2533	. . . . . . . . 9 |- F/ y E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) )
15	13, 14	nfrexya 2531	. . . . . . . 8 |- F/ y E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) )
16	12, 15	nfan 1576	. . . . . . 7 |- F/ y ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) )
17	11, 16	nfan 1576	. . . . . 6 |- F/ y ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) )
18	10, 17	nfan 1576	. . . . 5 |- F/ y ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) )
19		dfgcd3 12058	. . . . . . . 8 |- ( ( A e. ZZ /\ B e. ZZ ) -> ( A gcd B ) = ( iota_ w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) ) )
20	19	adantr 276	. . . . . . 7 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( A gcd B ) = ( iota_ w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) ) )
21		simprrl 539	. . . . . . . 8 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) )
22		simprl 529	. . . . . . . . 9 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> d e. NN0 )
23		simpll 527	. . . . . . . . . 10 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> A e. ZZ )
24		simplr 528	. . . . . . . . . 10 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> B e. ZZ )
25	23, 24, 22, 21	bezoutlemeu 12055	. . . . . . . . 9 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> E! w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) )
26		breq2 4029	. . . . . . . . . . . 12 |- ( w = d -> ( z || w <-> z || d ) )
27	26	bibi1d 233	. . . . . . . . . . 11 |- ( w = d -> ( ( z || w <-> ( z || A /\ z || B ) ) <-> ( z || d <-> ( z || A /\ z || B ) ) ) )
28	27	ralbidv 2490	. . . . . . . . . 10 |- ( w = d -> ( A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) <-> A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) ) )
29	28	riota2 5882	. . . . . . . . 9 |- ( ( d e. NN0 /\ E! w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) ) -> ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) <-> ( iota_ w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) ) = d ) )
30	22, 25, 29	syl2anc 411	. . . . . . . 8 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) <-> ( iota_ w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) ) = d ) )
31	21, 30	mpbid 147	. . . . . . 7 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( iota_ w e. NN0 A. z e. ZZ ( z || w <-> ( z || A /\ z || B ) ) ) = d )
32	20, 31	eqtrd 2222	. . . . . 6 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( A gcd B ) = d )
33	32	eqeq1d 2198	. . . . 5 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( ( A gcd B ) = ( ( A x. x ) + ( B x. y ) ) <-> d = ( ( A x. x ) + ( B x. y ) ) ) )
34	18, 33	rexbid 2489	. . . 4 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( E. y e. ZZ ( A gcd B ) = ( ( A x. x ) + ( B x. y ) ) <-> E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) )
35	9, 34	rexbid 2489	. . 3 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> ( E. x e. ZZ E. y e. ZZ ( A gcd B ) = ( ( A x. x ) + ( B x. y ) ) <-> E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) )
36	2, 35	mpbird 167	. 2 |- ( ( ( A e. ZZ /\ B e. ZZ ) /\ ( d e. NN0 /\ ( A. z e. ZZ ( z || d <-> ( z || A /\ z || B ) ) /\ E. x e. ZZ E. y e. ZZ d = ( ( A x. x ) + ( B x. y ) ) ) ) ) -> E. x e. ZZ E. y e. ZZ ( A gcd B ) = ( ( A x. x ) + ( B x. y ) ) )
37	1, 36	rexlimddv 2612	1 |- ( ( A e. ZZ /\ B e. ZZ ) -> E. x e. ZZ E. y e. ZZ ( A gcd B ) = ( ( A x. x ) + ( B x. y ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2160   A.wral 2468   E.wrex 2469   E!wreu 2470   class class class wbr 4025   iota_crio 5858  (class class class)co 5904   + caddc 7854   x. cmul 7856   NN0cn0 9217   ZZcz 9294   || cdvds 11841   gcd cgcd 11990

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4140  ax-sep 4143  ax-nul 4151  ax-pow 4199  ax-pr 4234  ax-un 4458  ax-setind 4561  ax-iinf 4612  ax-cnex 7942  ax-resscn 7943  ax-1cn 7944  ax-1re 7945  ax-icn 7946  ax-addcl 7947  ax-addrcl 7948  ax-mulcl 7949  ax-mulrcl 7950  ax-addcom 7951  ax-mulcom 7952  ax-addass 7953  ax-mulass 7954  ax-distr 7955  ax-i2m1 7956  ax-0lt1 7957  ax-1rid 7958  ax-0id 7959  ax-rnegex 7960  ax-precex 7961  ax-cnre 7962  ax-pre-ltirr 7963  ax-pre-ltwlin 7964  ax-pre-lttrn 7965  ax-pre-apti 7966  ax-pre-ltadd 7967  ax-pre-mulgt0 7968  ax-pre-mulext 7969  ax-arch 7970  ax-caucvg 7971

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2758  df-sbc 2982  df-csb 3077  df-dif 3150  df-un 3152  df-in 3154  df-ss 3161  df-nul 3442  df-if 3554  df-pw 3599  df-sn 3620  df-pr 3621  df-op 3623  df-uni 3832  df-int 3867  df-iun 3910  df-br 4026  df-opab 4087  df-mpt 4088  df-tr 4124  df-id 4318  df-po 4321  df-iso 4322  df-iord 4391  df-on 4393  df-ilim 4394  df-suc 4396  df-iom 4615  df-xp 4657  df-rel 4658  df-cnv 4659  df-co 4660  df-dm 4661  df-rn 4662  df-res 4663  df-ima 4664  df-iota 5203  df-fun 5244  df-fn 5245  df-f 5246  df-f1 5247  df-fo 5248  df-f1o 5249  df-fv 5250  df-riota 5859  df-ov 5907  df-oprab 5908  df-mpo 5909  df-1st 6173  df-2nd 6174  df-recs 6338  df-frec 6424  df-sup 7022  df-pnf 8035  df-mnf 8036  df-xr 8037  df-ltxr 8038  df-le 8039  df-sub 8171  df-neg 8172  df-reap 8573  df-ap 8580  df-div 8671  df-inn 8961  df-2 9019  df-3 9020  df-4 9021  df-n0 9218  df-z 9295  df-uz 9570  df-q 9662  df-rp 9696  df-fz 10051  df-fzo 10185  df-fl 10313  df-mod 10366  df-seqfrec 10491  df-exp 10566  df-cj 10898  df-re 10899  df-im 10900  df-rsqrt 11054  df-abs 11055  df-dvds 11842  df-gcd 11991

This theorem is referenced by:  dvdsgcd  12060  dvdsmulgcd  12073  lcmgcdlem  12126  divgcdcoprm0  12150  znunit  14001