Theorem infssuzcldc 10342

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 10340	. . 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 3269	. . . . . . 7 |- { n e. ( ZZ>= ` M ) | ps } C_ ( ZZ>= ` M )
7	2, 6	eqsstri 3216	. . . . . 6 |- S C_ ( ZZ>= ` M )
8		uzssz 9638	. . . . . 6 |- ( ZZ>= ` M ) C_ ZZ
9	7, 8	sstri 3193	. . . . 5 |- S C_ ZZ
10		zssre 9350	. . . . 5 |- ZZ C_ RR
11	9, 10	sstri 3193	. . . 4 |- S C_ RR
12	11	a1i 9	. . 3 |- ( ph -> S C_ RR )
13	5, 12	infrenegsupex 9685	. 2 |- ( ph -> inf ( S , RR , < ) = -u sup ( { w e. RR | -u w e. S } , RR , < ) )
14	1, 2, 3, 4	infssuzex 10340	. . . . . 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 9687	. . . . 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 8236	. . . . . . . . . 10 |- ( w = u -> -u w = -u u )
17	16	eleq1d 2265	. . . . . . . . 9 |- ( w = u -> ( -u w e. S <-> -u u e. S ) )
18	17	elrab 2920	. . . . . . . 8 |- ( u e. { w e. RR | -u w e. S } <-> ( u e. RR /\ -u u e. S ) )
19	9	sseli 3180	. . . . . . . . . 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 8072	. . . . . . . . . 10 |- ( ( u e. RR /\ -u u e. S ) -> u e. CC )
23		znegclb 9376	. . . . . . . . . 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 3188	. . . . . 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 9441	. . . 4 |- ( ph -> sup ( { w e. RR | -u w e. S } , RR , < ) e. { w e. RR | -u w e. S } )
30		nfrab1 2677	. . . . . 6 |- F/_ w { w e. RR | -u w e. S }
31		nfcv 2339	. . . . . 6 |- F/_ w RR
32		nfcv 2339	. . . . . 6 |- F/_ w <
33	30, 31, 32	nfsup 7067	. . . . 5 |- F/_ w sup ( { w e. RR | -u w e. S } , RR , < )
34	33	nfneg 8240	. . . . . 6 |- F/_ w -u sup ( { w e. RR | -u w e. S } , RR , < )
35	34	nfel1 2350	. . . . 5 |- F/ w -u sup ( { w e. RR | -u w e. S } , RR , < ) e. S
36		negeq 8236	. . . . . 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 2265	. . . . 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 2918	. . . 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 2273	1 |- ( ph -> inf ( S , RR , < ) e. S )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 835   = wceq 1364   e. wcel 2167   {crab 2479   C_ wss 3157   ` cfv 5259  (class class class)co 5925   supcsup 7057  infcinf 7058   CCcc 7894   RRcr 7895   < clt 8078   -ucneg 8215   ZZcz 9343   ZZ>=cuz 9618   ...cfz 10100

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-po 4332  df-iso 4333  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-isom 5268  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-sup 7059  df-inf 7060  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-fzo 10235

This theorem is referenced by:  zsupssdc  10345  bitsfzolem  12136  nnmindc  12226  nninfctlemfo  12232  lcmval  12256  lcmcllem  12260  odzcllem  12436  4sqlem13m  12597  4sqlem14  12598  4sqlem17  12601  4sqlem18  12602