Theorem bezoutlemle 12145

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 4032	. . . . . . . 8 |- ( z = w -> ( z || D <-> w || D ) )
3		breq1 4032	. . . . . . . . 9 |- ( z = w -> ( z || A <-> w || A ) )
4		breq1 4032	. . . . . . . . 9 |- ( z = w -> ( z || B <-> w || B ) )
5	3, 4	anbi12d 473	. . . . . . . 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 1717	. . . . . . 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 2726	. . . . . . . 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 488	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> A. w e. ZZ ( w || D <-> ( w || A /\ w || B ) ) )
14		simplr 528	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> z e. ZZ )
15	9, 13, 14	rspcdva 2869	. . . . 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 488	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D e. NN0 )
19		bezoutlemgcd.5	. . . . . . . . 9 |- ( ph -> -. ( A = 0 /\ B = 0 ) )
20	19	ad2antrr 488	. . . . . . . 8 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> -. ( A = 0 /\ B = 0 ) )
21		breq1 4032	. . . . . . . . . . . 12 |- ( z = 0 -> ( z || D <-> 0 || D ) )
22		breq1 4032	. . . . . . . . . . . . 13 |- ( z = 0 -> ( z || A <-> 0 || A ) )
23		breq1 4032	. . . . . . . . . . . . 13 |- ( z = 0 -> ( z || B <-> 0 || B ) )
24	22, 23	anbi12d 473	. . . . . . . . . . . 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 9329	. . . . . . . . . . 11 |- ( ph -> 0 e. ZZ )
27	25, 10, 26	rspcdva 2869	. . . . . . . . . 10 |- ( ph -> ( 0 || D <-> ( 0 || A /\ 0 || B ) ) )
28	27	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> ( 0 || D <-> ( 0 || A /\ 0 || B ) ) )
29	18	nn0zd 9437	. . . . . . . . . 10 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D e. ZZ )
30		0dvds 11954	. . . . . . . . . 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 488	. . . . . . . . . . 11 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> A e. ZZ )
34		0dvds 11954	. . . . . . . . . . 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 488	. . . . . . . . . . 11 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> B e. ZZ )
38		0dvds 11954	. . . . . . . . . . 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 473	. . . . . . . . 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 674	. . . . . . 7 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> -. D = 0 )
43	42	neqned 2371	. . . . . 6 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D =/= 0 )
44		elnnne0 9254	. . . . . 6 |- ( D e. NN <-> ( D e. NN0 /\ D =/= 0 ) )
45	18, 43, 44	sylanbrc 417	. . . . 5 |- ( ( ( ph /\ z e. ZZ ) /\ ( z || A /\ z || B ) ) -> D e. NN )
46		dvdsle 11986	. . . . 5 |- ( ( z e. ZZ /\ D e. NN ) -> ( z || D -> z <_ D ) )
47	14, 45, 46	syl2anc 411	. . . 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 2567	1 |- ( ph -> A. z e. ZZ ( ( z || A /\ z || B ) -> z <_ D ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2164   =/= wne 2364   A.wral 2472   class class class wbr 4029   0cc0 7872   <_ cle 8055   NNcn 8982   NN0cn0 9240   ZZcz 9317   || cdvds 11930

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 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-po 4327  df-iso 4328  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-n0 9241  df-z 9318  df-q 9685  df-dvds 11931

This theorem is referenced by:  bezoutlemsup  12146