Theorem gcdsupcl 11495

Description: Closure of the supremum used in defining gcd. A lemma for gcdval 11496 and gcdn0cl 11499. (Contributed by Jim Kingdon, 11-Dec-2021.)

Assertion

Ref	Expression
gcdsupcl	|- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> sup ( { n e. ZZ | ( n || X /\ n || Y ) } , RR , < ) e. NN )

Distinct variable groups:   n, X   n, Y

Proof of Theorem gcdsupcl

Dummy variable j is distinct from all other variables.

Step	Hyp	Ref	Expression
1		1zzd 8985	. . 3 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> 1 e. ZZ )
2		breq1 3898	. . . 4 |- ( n = 1 -> ( n || X <-> 1 || X ) )
3		breq1 3898	. . . 4 |- ( n = 1 -> ( n || Y <-> 1 || Y ) )
4	2, 3	anbi12d 462	. . 3 |- ( n = 1 -> ( ( n || X /\ n || Y ) <-> ( 1 || X /\ 1 || Y ) ) )
5		1dvds 11355	. . . . 5 |- ( X e. ZZ -> 1 || X )
6		1dvds 11355	. . . . 5 |- ( Y e. ZZ -> 1 || Y )
7	5, 6	anim12i 334	. . . 4 |- ( ( X e. ZZ /\ Y e. ZZ ) -> ( 1 || X /\ 1 || Y ) )
8	7	adantr 272	. . 3 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> ( 1 || X /\ 1 || Y ) )
9		elnnuz 9264	. . . . . . 7 |- ( n e. NN <-> n e. ( ZZ>= ` 1 ) )
10	9	biimpri 132	. . . . . 6 |- ( n e. ( ZZ>= ` 1 ) -> n e. NN )
11		simpll 501	. . . . . 6 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ n e. ( ZZ>= ` 1 ) ) -> X e. ZZ )
12		dvdsdc 11349	. . . . . 6 |- ( ( n e. NN /\ X e. ZZ ) -> DECID n || X )
13	10, 11, 12	syl2an2 566	. . . . 5 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ n e. ( ZZ>= ` 1 ) ) -> DECID n || X )
14		simplr 502	. . . . . 6 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ n e. ( ZZ>= ` 1 ) ) -> Y e. ZZ )
15		dvdsdc 11349	. . . . . 6 |- ( ( n e. NN /\ Y e. ZZ ) -> DECID n || Y )
16	10, 14, 15	syl2an2 566	. . . . 5 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ n e. ( ZZ>= ` 1 ) ) -> DECID n || Y )
17		dcan 901	. . . . 5 |- (DECID n || X -> (DECID n || Y -> DECID ( n || X /\ n || Y ) ) )
18	13, 16, 17	sylc 62	. . . 4 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ n e. ( ZZ>= ` 1 ) ) -> DECID ( n || X /\ n || Y ) )
19	18	adantlr 466	. . 3 |- ( ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) /\ n e. ( ZZ>= ` 1 ) ) -> DECID ( n || X /\ n || Y ) )
20		simplll 505	. . . . 5 |- ( ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) /\ X =/= 0 ) -> X e. ZZ )
21		dvdsbnd 11493	. . . . . . 7 |- ( ( X e. ZZ /\ X =/= 0 ) -> E. j e. NN A. n e. ( ZZ>= ` j ) -. n || X )
22		nnuz 9263	. . . . . . . 8 |- NN = ( ZZ>= ` 1 )
23	22	rexeqi 2605	. . . . . . 7 |- ( E. j e. NN A. n e. ( ZZ>= ` j ) -. n || X <-> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. n || X )
24	21, 23	sylib 121	. . . . . 6 |- ( ( X e. ZZ /\ X =/= 0 ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. n || X )
25		id 19	. . . . . . . . 9 |- ( -. n || X -> -. n || X )
26	25	intnanrd 900	. . . . . . . 8 |- ( -. n || X -> -. ( n || X /\ n || Y ) )
27	26	ralimi 2469	. . . . . . 7 |- ( A. n e. ( ZZ>= ` j ) -. n || X -> A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
28	27	reximi 2503	. . . . . 6 |- ( E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. n || X -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
29	24, 28	syl 14	. . . . 5 |- ( ( X e. ZZ /\ X =/= 0 ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
30	20, 29	sylancom 414	. . . 4 |- ( ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) /\ X =/= 0 ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
31		simpllr 506	. . . . 5 |- ( ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) /\ Y =/= 0 ) -> Y e. ZZ )
32		dvdsbnd 11493	. . . . . . 7 |- ( ( Y e. ZZ /\ Y =/= 0 ) -> E. j e. NN A. n e. ( ZZ>= ` j ) -. n || Y )
33	22	rexeqi 2605	. . . . . . 7 |- ( E. j e. NN A. n e. ( ZZ>= ` j ) -. n || Y <-> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. n || Y )
34	32, 33	sylib 121	. . . . . 6 |- ( ( Y e. ZZ /\ Y =/= 0 ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. n || Y )
35		id 19	. . . . . . . . 9 |- ( -. n || Y -> -. n || Y )
36	35	intnand 899	. . . . . . . 8 |- ( -. n || Y -> -. ( n || X /\ n || Y ) )
37	36	ralimi 2469	. . . . . . 7 |- ( A. n e. ( ZZ>= ` j ) -. n || Y -> A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
38	37	reximi 2503	. . . . . 6 |- ( E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. n || Y -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
39	34, 38	syl 14	. . . . 5 |- ( ( Y e. ZZ /\ Y =/= 0 ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
40	31, 39	sylancom 414	. . . 4 |- ( ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) /\ Y =/= 0 ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
41		simpr 109	. . . . . 6 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> -. ( X = 0 /\ Y = 0 ) )
42		simpll 501	. . . . . . . 8 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> X e. ZZ )
43		0z 8969	. . . . . . . 8 |- 0 e. ZZ
44		zdceq 9030	. . . . . . . 8 |- ( ( X e. ZZ /\ 0 e. ZZ ) -> DECID X = 0 )
45	42, 43, 44	sylancl 407	. . . . . . 7 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> DECID X = 0 )
46		ianordc 867	. . . . . . 7 |- (DECID X = 0 -> ( -. ( X = 0 /\ Y = 0 ) <-> ( -. X = 0 \/ -. Y = 0 ) ) )
47	45, 46	syl 14	. . . . . 6 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> ( -. ( X = 0 /\ Y = 0 ) <-> ( -. X = 0 \/ -. Y = 0 ) ) )
48	41, 47	mpbid 146	. . . . 5 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> ( -. X = 0 \/ -. Y = 0 ) )
49		df-ne 2283	. . . . . 6 |- ( X =/= 0 <-> -. X = 0 )
50		df-ne 2283	. . . . . 6 |- ( Y =/= 0 <-> -. Y = 0 )
51	49, 50	orbi12i 736	. . . . 5 |- ( ( X =/= 0 \/ Y =/= 0 ) <-> ( -. X = 0 \/ -. Y = 0 ) )
52	48, 51	sylibr 133	. . . 4 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> ( X =/= 0 \/ Y =/= 0 ) )
53	30, 40, 52	mpjaodan 770	. . 3 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> E. j e. ( ZZ>= ` 1 ) A. n e. ( ZZ>= ` j ) -. ( n || X /\ n || Y ) )
54	1, 4, 8, 19, 53	zsupcl 11488	. 2 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> sup ( { n e. ZZ | ( n || X /\ n || Y ) } , RR , < ) e. ( ZZ>= ` 1 ) )
55	54, 22	syl6eleqr 2208	1 |- ( ( ( X e. ZZ /\ Y e. ZZ ) /\ -. ( X = 0 /\ Y = 0 ) ) -> sup ( { n e. ZZ | ( n || X /\ n || Y ) } , RR , < ) e. NN )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 680  DECID wdc 802   = wceq 1314   e. wcel 1463   =/= wne 2282   A.wral 2390   E.wrex 2391   {crab 2394   class class class wbr 3895   ` cfv 5081   supcsup 6821   RRcr 7546   0cc0 7547   1c1 7548   < clt 7724   NNcn 8630   ZZcz 8958   ZZ>=cuz 9228   || cdvds 11341

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4003  ax-sep 4006  ax-nul 4014  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412  ax-iinf 4462  ax-cnex 7636  ax-resscn 7637  ax-1cn 7638  ax-1re 7639  ax-icn 7640  ax-addcl 7641  ax-addrcl 7642  ax-mulcl 7643  ax-mulrcl 7644  ax-addcom 7645  ax-mulcom 7646  ax-addass 7647  ax-mulass 7648  ax-distr 7649  ax-i2m1 7650  ax-0lt1 7651  ax-1rid 7652  ax-0id 7653  ax-rnegex 7654  ax-precex 7655  ax-cnre 7656  ax-pre-ltirr 7657  ax-pre-ltwlin 7658  ax-pre-lttrn 7659  ax-pre-apti 7660  ax-pre-ltadd 7661  ax-pre-mulgt0 7662  ax-pre-mulext 7663  ax-arch 7664  ax-caucvg 7665

This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-nel 2378  df-ral 2395  df-rex 2396  df-reu 2397  df-rmo 2398  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-nul 3330  df-if 3441  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-int 3738  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-tr 3987  df-id 4175  df-po 4178  df-iso 4179  df-iord 4248  df-on 4250  df-ilim 4251  df-suc 4253  df-iom 4465  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-f1 5086  df-fo 5087  df-f1o 5088  df-fv 5089  df-riota 5684  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-recs 6156  df-frec 6242  df-sup 6823  df-pnf 7726  df-mnf 7727  df-xr 7728  df-ltxr 7729  df-le 7730  df-sub 7858  df-neg 7859  df-reap 8255  df-ap 8262  df-div 8346  df-inn 8631  df-2 8689  df-3 8690  df-4 8691  df-n0 8882  df-z 8959  df-uz 9229  df-q 9314  df-rp 9344  df-fz 9684  df-fzo 9813  df-fl 9936  df-mod 9989  df-seqfrec 10112  df-exp 10186  df-cj 10507  df-re 10508  df-im 10509  df-rsqrt 10662  df-abs 10663  df-dvds 11342

This theorem is referenced by:  gcdval  11496  gcdn0cl  11499