Theorem infssuzcldc 10455

Description: The infimum of a subset of an upper set of integers belongs to the subset. (Contributed by Jim Kingdon, 20-Jan-2022.)

Hypotheses

Ref	Expression
infssuzledc.m	|- ( ph -> M e. ZZ )
infssuzledc.s	|- S = { n e. ( ZZ>= ` M ) | ps }
infssuzledc.a	|- ( ph -> A e. S )
infssuzledc.dc	|- ( ( ph /\ n e. ( M ... A ) ) -> DECID ps )

Assertion

Ref	Expression
infssuzcldc	|- ( ph -> inf ( S , RR , < ) e. S )

Distinct variable groups:   A, n   n, M   ph, n

Allowed substitution hints:   ps( n)   S( n)

Proof of Theorem infssuzcldc

Dummy variables y w x z u are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		infssuzledc.m	. . . 4 |- ( ph -> M e. ZZ )
2		infssuzledc.s	. . . 4 |- S = { n e. ( ZZ>= ` M ) | ps }
3		infssuzledc.a	. . . 4 |- ( ph -> A e. S )
4		infssuzledc.dc	. . . 4 |- ( ( ph /\ n e. ( M ... A ) ) -> DECID ps )
5	1, 2, 3, 4	infssuzex 10453	. . 3 |- ( ph -> E. x e. RR ( A. y e. S -. y < x /\ A. y e. RR ( x < y -> E. w e. S w < y ) ) )
6		ssrab2 3309	. . . . . . 7 |- { n e. ( ZZ>= ` M ) | ps } C_ ( ZZ>= ` M )
7	2, 6	eqsstri 3256	. . . . . 6 |- S C_ ( ZZ>= ` M )
8		uzssz 9742	. . . . . 6 |- ( ZZ>= ` M ) C_ ZZ
9	7, 8	sstri 3233	. . . . 5 |- S C_ ZZ
10		zssre 9453	. . . . 5 |- ZZ C_ RR
11	9, 10	sstri 3233	. . . 4 |- S C_ RR
12	11	a1i 9	. . 3 |- ( ph -> S C_ RR )
13	5, 12	infrenegsupex 9789	. 2 |- ( ph -> inf ( S , RR , < ) = -u sup ( { w e. RR | -u w e. S } , RR , < ) )
14	1, 2, 3, 4	infssuzex 10453	. . . . . 6 |- ( ph -> E. x e. RR ( A. y e. S -. y < x /\ A. y e. RR ( x < y -> E. z e. S z < y ) ) )
15	14, 12	infsupneg 9791	. . . . 5 |- ( ph -> E. x e. RR ( A. y e. { w e. RR | -u w e. S } -. x < y /\ A. y e. RR ( y < x -> E. z e. { w e. RR | -u w e. S } y < z ) ) )
16		negeq 8339	. . . . . . . . . 10 |- ( w = u -> -u w = -u u )
17	16	eleq1d 2298	. . . . . . . . 9 |- ( w = u -> ( -u w e. S <-> -u u e. S ) )
18	17	elrab 2959	. . . . . . . 8 |- ( u e. { w e. RR | -u w e. S } <-> ( u e. RR /\ -u u e. S ) )
19	9	sseli 3220	. . . . . . . . . 10 |- ( -u u e. S -> -u u e. ZZ )
20	19	adantl 277	. . . . . . . . 9 |- ( ( u e. RR /\ -u u e. S ) -> -u u e. ZZ )
21		simpl 109	. . . . . . . . . . 11 |- ( ( u e. RR /\ -u u e. S ) -> u e. RR )
22	21	recnd 8175	. . . . . . . . . 10 |- ( ( u e. RR /\ -u u e. S ) -> u e. CC )
23		znegclb 9479	. . . . . . . . . 10 |- ( u e. CC -> ( u e. ZZ <-> -u u e. ZZ ) )
24	22, 23	syl 14	. . . . . . . . 9 |- ( ( u e. RR /\ -u u e. S ) -> ( u e. ZZ <-> -u u e. ZZ ) )
25	20, 24	mpbird 167	. . . . . . . 8 |- ( ( u e. RR /\ -u u e. S ) -> u e. ZZ )
26	18, 25	sylbi 121	. . . . . . 7 |- ( u e. { w e. RR | -u w e. S } -> u e. ZZ )
27	26	ssriv 3228	. . . . . 6 |- { w e. RR | -u w e. S } C_ ZZ
28	27	a1i 9	. . . . 5 |- ( ph -> { w e. RR | -u w e. S } C_ ZZ )
29	15, 28	suprzclex 9545	. . . 4 |- ( ph -> sup ( { w e. RR | -u w e. S } , RR , < ) e. { w e. RR | -u w e. S } )
30		nfrab1 2711	. . . . . 6 |- F/_ w { w e. RR | -u w e. S }
31		nfcv 2372	. . . . . 6 |- F/_ w RR
32		nfcv 2372	. . . . . 6 |- F/_ w <
33	30, 31, 32	nfsup 7159	. . . . 5 |- F/_ w sup ( { w e. RR | -u w e. S } , RR , < )
34	33	nfneg 8343	. . . . . 6 |- F/_ w -u sup ( { w e. RR | -u w e. S } , RR , < )
35	34	nfel1 2383	. . . . 5 |- F/ w -u sup ( { w e. RR | -u w e. S } , RR , < ) e. S
36		negeq 8339	. . . . . 6 |- ( w = sup ( { w e. RR | -u w e. S } , RR , < ) -> -u w = -u sup ( { w e. RR | -u w e. S } , RR , < ) )
37	36	eleq1d 2298	. . . . 5 |- ( w = sup ( { w e. RR | -u w e. S } , RR , < ) -> ( -u w e. S <-> -u sup ( { w e. RR | -u w e. S } , RR , < ) e. S ) )
38	33, 31, 35, 37	elrabf 2957	. . . 4 |- ( sup ( { w e. RR | -u w e. S } , RR , < ) e. { w e. RR | -u w e. S } <-> ( sup ( { w e. RR | -u w e. S } , RR , < ) e. RR /\ -u sup ( { w e. RR | -u w e. S } , RR , < ) e. S ) )
39	29, 38	sylib 122	. . 3 |- ( ph -> ( sup ( { w e. RR | -u w e. S } , RR , < ) e. RR /\ -u sup ( { w e. RR | -u w e. S } , RR , < ) e. S ) )
40	39	simprd 114	. 2 |- ( ph -> -u sup ( { w e. RR | -u w e. S } , RR , < ) e. S )
41	13, 40	eqeltrd 2306	1 |- ( ph -> inf ( S , RR , < ) e. S )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 839   = wceq 1395   e. wcel 2200   {crab 2512   C_ wss 3197   ` cfv 5318  (class class class)co 6001   supcsup 7149  infcinf 7150   CCcc 7997   RRcr 7998   < clt 8181   -ucneg 8318   ZZcz 9446   ZZ>=cuz 9722   ...cfz 10204

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-isom 5327  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-sup 7151  df-inf 7152  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723  df-fz 10205  df-fzo 10339

This theorem is referenced by:  zsupssdc  10458  bitsfzolem  12465  nnmindc  12555  nninfctlemfo  12561  lcmval  12585  lcmcllem  12589  odzcllem  12765  4sqlem13m  12926  4sqlem14  12927  4sqlem17  12930  4sqlem18  12931