Theorem bezoutlemsup 12146

Description: Lemma for Bézout's identity. The number satisfying the greatest common divisor condition is the supremum of divisors of 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
bezoutlemsup	|- ( ph -> D = sup ( { z e. ZZ | ( z || A /\ z || B ) } , RR , < ) )

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

Proof of Theorem bezoutlemsup

Dummy variables w f g u are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bezoutlemgcd.3	. . . 4 |- ( ph -> D e. NN0 )
2	1	nn0red 9294	. . 3 |- ( ph -> D e. RR )
3		elrabi 2913	. . . . . . 7 |- ( w e. { z e. ZZ | ( z || A /\ z || B ) } -> w e. ZZ )
4	3	adantl 277	. . . . . 6 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> w e. ZZ )
5	4	zred 9439	. . . . 5 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> w e. RR )
6	2	adantr 276	. . . . 5 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> D e. RR )
7		breq1 4032	. . . . . . . . . 10 |- ( z = w -> ( z || A <-> w || A ) )
8		breq1 4032	. . . . . . . . . 10 |- ( z = w -> ( z || B <-> w || B ) )
9	7, 8	anbi12d 473	. . . . . . . . 9 |- ( z = w -> ( ( z || A /\ z || B ) <-> ( w || A /\ w || B ) ) )
10	9	elrab 2916	. . . . . . . 8 |- ( w e. { z e. ZZ | ( z || A /\ z || B ) } <-> ( w e. ZZ /\ ( w || A /\ w || B ) ) )
11	10	simprbi 275	. . . . . . 7 |- ( w e. { z e. ZZ | ( z || A /\ z || B ) } -> ( w || A /\ w || B ) )
12	11	adantl 277	. . . . . 6 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> ( w || A /\ w || B ) )
13		breq1 4032	. . . . . . . . 9 |- ( z = w -> ( z <_ D <-> w <_ D ) )
14	9, 13	imbi12d 234	. . . . . . . 8 |- ( z = w -> ( ( ( z || A /\ z || B ) -> z <_ D ) <-> ( ( w || A /\ w || B ) -> w <_ D ) ) )
15		bezoutlemgcd.1	. . . . . . . . . 10 |- ( ph -> A e. ZZ )
16		bezoutlemgcd.2	. . . . . . . . . 10 |- ( ph -> B e. ZZ )
17		bezoutlemgcd.4	. . . . . . . . . 10 |- ( ph -> A. z e. ZZ ( z || D <-> ( z || A /\ z || B ) ) )
18		bezoutlemgcd.5	. . . . . . . . . 10 |- ( ph -> -. ( A = 0 /\ B = 0 ) )
19	15, 16, 1, 17, 18	bezoutlemle 12145	. . . . . . . . 9 |- ( ph -> A. z e. ZZ ( ( z || A /\ z || B ) -> z <_ D ) )
20	19	adantr 276	. . . . . . . 8 |- ( ( ph /\ w e. ZZ ) -> A. z e. ZZ ( ( z || A /\ z || B ) -> z <_ D ) )
21		simpr 110	. . . . . . . 8 |- ( ( ph /\ w e. ZZ ) -> w e. ZZ )
22	14, 20, 21	rspcdva 2869	. . . . . . 7 |- ( ( ph /\ w e. ZZ ) -> ( ( w || A /\ w || B ) -> w <_ D ) )
23	3, 22	sylan2 286	. . . . . 6 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> ( ( w || A /\ w || B ) -> w <_ D ) )
24	12, 23	mpd 13	. . . . 5 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> w <_ D )
25	5, 6, 24	lensymd 8141	. . . 4 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> -. D < w )
26	25	ralrimiva 2567	. . 3 |- ( ph -> A. w e. { z e. ZZ | ( z || A /\ z || B ) } -. D < w )
27	1	nn0zd 9437	. . . . . . . . . 10 |- ( ph -> D e. ZZ )
28		iddvds 11947	. . . . . . . . . 10 |- ( D e. ZZ -> D || D )
29	27, 28	syl 14	. . . . . . . . 9 |- ( ph -> D || D )
30		breq1 4032	. . . . . . . . . . 11 |- ( z = D -> ( z || D <-> D || D ) )
31		breq1 4032	. . . . . . . . . . . 12 |- ( z = D -> ( z || A <-> D || A ) )
32		breq1 4032	. . . . . . . . . . . 12 |- ( z = D -> ( z || B <-> D || B ) )
33	31, 32	anbi12d 473	. . . . . . . . . . 11 |- ( z = D -> ( ( z || A /\ z || B ) <-> ( D || A /\ D || B ) ) )
34	30, 33	bibi12d 235	. . . . . . . . . 10 |- ( z = D -> ( ( z || D <-> ( z || A /\ z || B ) ) <-> ( D || D <-> ( D || A /\ D || B ) ) ) )
35	34, 17, 27	rspcdva 2869	. . . . . . . . 9 |- ( ph -> ( D || D <-> ( D || A /\ D || B ) ) )
36	29, 35	mpbid 147	. . . . . . . 8 |- ( ph -> ( D || A /\ D || B ) )
37	36	ad2antrr 488	. . . . . . 7 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> ( D || A /\ D || B ) )
38	1	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> D e. NN0 )
39	38	nn0zd 9437	. . . . . . . 8 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> D e. ZZ )
40	33	elrab3 2917	. . . . . . . 8 |- ( D e. ZZ -> ( D e. { z e. ZZ | ( z || A /\ z || B ) } <-> ( D || A /\ D || B ) ) )
41	39, 40	syl 14	. . . . . . 7 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> ( D e. { z e. ZZ | ( z || A /\ z || B ) } <-> ( D || A /\ D || B ) ) )
42	37, 41	mpbird 167	. . . . . 6 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> D e. { z e. ZZ | ( z || A /\ z || B ) } )
43		breq2 4033	. . . . . . 7 |- ( u = D -> ( w < u <-> w < D ) )
44	43	rspcev 2864	. . . . . 6 |- ( ( D e. { z e. ZZ | ( z || A /\ z || B ) } /\ w < D ) -> E. u e. { z e. ZZ | ( z || A /\ z || B ) } w < u )
45	42, 44	sylancom 420	. . . . 5 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> E. u e. { z e. ZZ | ( z || A /\ z || B ) } w < u )
46	45	ex 115	. . . 4 |- ( ( ph /\ w e. RR ) -> ( w < D -> E. u e. { z e. ZZ | ( z || A /\ z || B ) } w < u ) )
47	46	ralrimiva 2567	. . 3 |- ( ph -> A. w e. RR ( w < D -> E. u e. { z e. ZZ | ( z || A /\ z || B ) } w < u ) )
48		lttri3 8099	. . . . 5 |- ( ( f e. RR /\ g e. RR ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
49	48	adantl 277	. . . 4 |- ( ( ph /\ ( f e. RR /\ g e. RR ) ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
50	49	eqsupti 7055	. . 3 |- ( ph -> ( ( D e. RR /\ A. w e. { z e. ZZ | ( z || A /\ z || B ) } -. D < w /\ A. w e. RR ( w < D -> E. u e. { z e. ZZ | ( z || A /\ z || B ) } w < u ) ) -> sup ( { z e. ZZ | ( z || A /\ z || B ) } , RR , < ) = D ) )
51	2, 26, 47, 50	mp3and 1351	. 2 |- ( ph -> sup ( { z e. ZZ | ( z || A /\ z || B ) } , RR , < ) = D )
52	51	eqcomd 2199	1 |- ( ph -> D = sup ( { z e. ZZ | ( z || A /\ z || B ) } , RR , < ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2164   A.wral 2472   E.wrex 2473   {crab 2476   class class class wbr 4029   supcsup 7041   RRcr 7871   0cc0 7872   < clt 8054   <_ cle 8055   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-sup 7043  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:  dfgcd3  12147