Theorem bezoutlemle 12785

Description: Lemma for Bézout's identity. The number satisfying the greatest common divisor condition is the largest number which divides both A and B. (Contributed by Mario Carneiro and Jim Kingdon, 9-Jan-2022.)

Hypotheses

Ref	Expression
bezoutlemgcd.1	|- ( ph -> A e. ZZ )
bezoutlemgcd.2	|- ( ph -> B e. ZZ )
bezoutlemgcd.3	|- ( ph -> D e. NN0 )
bezoutlemgcd.4	|- ( ph -> A. z e. ZZ ( z || D <-> ( z || A /\ z || B ) ) )
bezoutlemgcd.5	|- ( ph -> -. ( A = 0 /\ B = 0 ) )

Assertion

Ref	Expression
bezoutlemle	|- ( ph -> A. z e. ZZ ( ( z || A /\ z || B ) -> z <_ D ) )

Distinct variable groups:   z, D   z, A   z, B   ph, z

Proof of Theorem bezoutlemle

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 110	. . . . 5 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( z || A /\ z || B ) )
2		breq1 4133	. . . . . . . 8 |- ( z = w -> ( z || D <-> w || D ) )
3		breq1 4133	. . . . . . . . 9 |- ( z = w -> ( z || A <-> w || A ) )
4		breq1 4133	. . . . . . . . 9 |- ( z = w -> ( z || B <-> w || B ) )
5	3, 4	anbi12d 477	. . . . . . . 8 |- ( z = w -> ( ( z || A /\ z || B ) <-> ( w || A /\ w || B ) ) )
6	2, 5	bibi12d 235	. . . . . . 7 |- ( z = w -> ( ( z || D <-> ( z || A /\ z || B ) ) <-> ( w || D <-> ( w || A /\ w || B ) ) ) )
7		equcom 1758	. . . . . . 7 |- ( z = w <-> w = z )
8		bicom 140	. . . . . . 7 |- ( ( ( z || D <-> ( z || A /\ z || B ) ) <-> ( w || D <-> ( w || A /\ w || B ) ) ) <-> ( ( w || D <-> ( w || A /\ w || B ) ) <-> ( z || D <-> ( z || A /\ z || B ) ) ) )
9	6, 7, 8	3imtr3i 200	. . . . . 6 |- ( w = z -> ( ( w || D <-> ( w || A /\ w || B ) ) <-> ( z || D <-> ( z || A /\ z || B ) ) ) )
10		bezoutlemgcd.4	. . . . . . . 8 |- ( ph -> A. z e. ZZ ( z || D <-> ( z || A /\ z || B ) ) )
11	6	cbvralv 2786	. . . . . . . 8 |- ( A. z e. ZZ ( z || D <-> ( z || A /\ z || B ) ) <-> A. w e. ZZ ( w || D <-> ( w || A /\ w || B ) ) )
12	10, 11	sylib 122	. . . . . . 7 |- ( ph -> A. w e. ZZ ( w || D <-> ( w || A /\ w || B ) ) )
13	12	ad2antrr 492	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> A. w e. ZZ ( w || D <-> ( w || A /\ w || B ) ) )
14		simplr 533	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> z e. ZZ )
15	9, 13, 14	rspcdva 2934	. . . . 5 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( z || D <-> ( z || A /\ z || B ) ) )
16	1, 15	mpbird 167	. . . 4 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> z || D )
17		bezoutlemgcd.3	. . . . . . 7 |- ( ph -> D e. NN0 )
18	17	ad2antrr 492	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D e. NN0 )
19		bezoutlemgcd.5	. . . . . . . . 9 |- ( ph -> -. ( A = 0 /\ B = 0 ) )
20	19	ad2antrr 492	. . . . . . . 8 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> -. ( A = 0 /\ B = 0 ) )
21		breq1 4133	. . . . . . . . . . . 12 |- ( z = 0 -> ( z || D <-> 0 || D ) )
22		breq1 4133	. . . . . . . . . . . . 13 |- ( z = 0 -> ( z || A <-> 0 || A ) )
23		breq1 4133	. . . . . . . . . . . . 13 |- ( z = 0 -> ( z || B <-> 0 || B ) )
24	22, 23	anbi12d 477	. . . . . . . . . . . 12 |- ( z = 0 -> ( ( z || A /\ z || B ) <-> ( 0 || A /\ 0 || B ) ) )
25	21, 24	bibi12d 235	. . . . . . . . . . 11 |- ( z = 0 -> ( ( z || D <-> ( z || A /\ z || B ) ) <-> ( 0 || D <-> ( 0 || A /\ 0 || B ) ) ) )
26		0zd 9656	. . . . . . . . . . 11 |- ( ph -> 0 e. ZZ )
27	25, 10, 26	rspcdva 2934	. . . . . . . . . 10 |- ( ph -> ( 0 || D <-> ( 0 || A /\ 0 || B ) ) )
28	27	ad2antrr 492	. . . . . . . . 9 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( 0 || D <-> ( 0 || A /\ 0 || B ) ) )
29	18	nn0zd 9766	. . . . . . . . . 10 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D e. ZZ )
30		0dvds 12578	. . . . . . . . . 10 |- ( D e. ZZ -> ( 0 || D <-> D = 0 ) )
31	29, 30	syl 14	. . . . . . . . 9 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( 0 || D <-> D = 0 ) )
32		bezoutlemgcd.1	. . . . . . . . . . . 12 |- ( ph -> A e. ZZ )
33	32	ad2antrr 492	. . . . . . . . . . 11 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> A e. ZZ )
34		0dvds 12578	. . . . . . . . . . 11 |- ( A e. ZZ -> ( 0 || A <-> A = 0 ) )
35	33, 34	syl 14	. . . . . . . . . 10 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( 0 || A <-> A = 0 ) )
36		bezoutlemgcd.2	. . . . . . . . . . . 12 |- ( ph -> B e. ZZ )
37	36	ad2antrr 492	. . . . . . . . . . 11 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> B e. ZZ )
38		0dvds 12578	. . . . . . . . . . 11 |- ( B e. ZZ -> ( 0 || B <-> B = 0 ) )
39	37, 38	syl 14	. . . . . . . . . 10 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( 0 || B <-> B = 0 ) )
40	35, 39	anbi12d 477	. . . . . . . . 9 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( ( 0 || A /\ 0 || B ) <-> ( A = 0 /\ B = 0 ) ) )
41	28, 31, 40	3bitr3d 218	. . . . . . . 8 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( D = 0 <-> ( A = 0 /\ B = 0 ) ) )
42	20, 41	mtbird 684	. . . . . . 7 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> -. D = 0 )
43	42	neqned 2427	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D =/= 0 )
44		elnnne0 9577	. . . . . 6 |- ( D e. NN <-> ( D e. NN0 /\ D =/= 0 ) )
45	18, 43, 44	sylanbrc 421	. . . . 5 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D e. NN )
46		dvdsle 12611	. . . . 5 |- ( ( z e. ZZ /\ D e. NN ) -> ( z || D -> z <_ D ) )
47	14, 45, 46	syl2anc 415	. . . 4 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( z || D -> z <_ D ) )
48	16, 47	mpd 13	. . 3 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> z <_ D )
49	48	ex 115	. 2 |- ( ( ph /\ z e. ZZ ) -> ( ( z || A /\ z || B ) -> z <_ D ) )
50	49	ralrimiva 2623	1 |- ( ph -> A. z e. ZZ ( ( z || A /\ z || B ) -> z <_ D ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   =/= wne 2420   A.wral 2528   class class class wbr 4130   0cc0 8179   <_ cle 8361   NNcn 9304   NN0cn0 9563   ZZcz 9644   || cdvds 12554

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-q 10020  df-dvds 12555

This theorem is used by:  bezoutlemsup  12786