Theorem bezoutlemsup 12012

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 9232	. . 3 |- ( ph -> D e. RR )
3		elrabi 2892	. . . . . . 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 9377	. . . . 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 4008	. . . . . . . . . 10 |- ( z = w -> ( z || A <-> w || A ) )
8		breq1 4008	. . . . . . . . . 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 2895	. . . . . . . 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 4008	. . . . . . . . 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 12011	. . . . . . . . 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 2848	. . . . . . 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 8081	. . . 4 |- ( ( ph /\ w e. { z e. ZZ | ( z || A /\ z || B ) } ) -> -. D < w )
26	25	ralrimiva 2550	. . 3 |- ( ph -> A. w e. { z e. ZZ | ( z || A /\ z || B ) } -. D < w )
27	1	nn0zd 9375	. . . . . . . . . 10 |- ( ph -> D e. ZZ )
28		iddvds 11813	. . . . . . . . . 10 |- ( D e. ZZ -> D || D )
29	27, 28	syl 14	. . . . . . . . 9 |- ( ph -> D || D )
30		breq1 4008	. . . . . . . . . . 11 |- ( z = D -> ( z || D <-> D || D ) )
31		breq1 4008	. . . . . . . . . . . 12 |- ( z = D -> ( z || A <-> D || A ) )
32		breq1 4008	. . . . . . . . . . . 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 2848	. . . . . . . . 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 9375	. . . . . . . 8 |- ( ( ( ph /\ w e. RR ) /\ w < D ) -> D e. ZZ )
40	33	elrab3 2896	. . . . . . . 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 4009	. . . . . . 7 |- ( u = D -> ( w < u <-> w < D ) )
44	43	rspcev 2843	. . . . . 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 2550	. . 3 |- ( ph -> A. w e. RR ( w < D -> E. u e. { z e. ZZ | ( z || A /\ z || B ) } w < u ) )
48		lttri3 8039	. . . . 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 6997	. . 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 1340	. 2 |- ( ph -> sup ( { z e. ZZ | ( z || A /\ z || B ) } , RR , < ) = D )
52	51	eqcomd 2183	1 |- ( ph -> D = sup ( { z e. ZZ | ( z || A /\ z || B ) } , RR , < ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2148   A.wral 2455   E.wrex 2456   {crab 2459   class class class wbr 4005   supcsup 6983   RRcr 7812   0cc0 7813   < clt 7994   <_ cle 7995   NN0cn0 9178   ZZcz 9255   || cdvds 11796

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931

This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-po 4298  df-iso 4299  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-sup 6985  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-div 8632  df-inn 8922  df-n0 9179  df-z 9256  df-q 9622  df-dvds 11797

This theorem is referenced by:  dfgcd3  12013