Theorem zssinfcl 10344

Description: The infimum of a set of integers is an element of the set. (Contributed by Jim Kingdon, 16-Jan-2022.)

Hypotheses

Ref	Expression
zssinfcl.ex	|- ( ph -> E. x e. RR ( A. y e. B -. y < x /\ A. y e. RR ( x < y -> E. z e. B z < y ) ) )
zssinfcl.ss	|- ( ph -> B C_ ZZ )
zssinfcl.zz	|- ( ph -> inf ( B , RR , < ) e. ZZ )

Assertion

Ref	Expression
zssinfcl	|- ( ph -> inf ( B , RR , < ) e. B )

Distinct variable groups:   x, B, y, z   ph, x, y, z

Proof of Theorem zssinfcl

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

Step	Hyp	Ref	Expression
1		zssinfcl.zz	. . . . 5 |- ( ph -> inf ( B , RR , < ) e. ZZ )
2	1	zred 8469	. . . 4 |- ( ph -> inf ( B , RR , < ) e. RR )
3		1red 7134	. . . 4 |- ( ph -> 1 e. RR )
4	2, 3	readdcld 7148	. . 3 |- ( ph -> (inf ( B , RR , < ) + 1 ) e. RR )
5	2	ltp1d 8008	. . 3 |- ( ph -> inf ( B , RR , < ) < (inf ( B , RR , < ) + 1 ) )
6		lttri3 7191	. . . . 5 |- ( ( f e. RR /\ g e. RR ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
7	6	adantl 271	. . . 4 |- ( ( ph /\ ( f e. RR /\ g e. RR ) ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
8		zssinfcl.ex	. . . 4 |- ( ph -> E. x e. RR ( A. y e. B -. y < x /\ A. y e. RR ( x < y -> E. z e. B z < y ) ) )
9	7, 8	infglbti 6438	. . 3 |- ( ph -> ( ( (inf ( B , RR , < ) + 1 ) e. RR /\ inf ( B , RR , < ) < (inf ( B , RR , < ) + 1 ) ) -> E. z e. B z < (inf ( B , RR , < ) + 1 ) ) )
10	4, 5, 9	mp2and 423	. 2 |- ( ph -> E. z e. B z < (inf ( B , RR , < ) + 1 ) )
11	2	adantr 270	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) e. RR )
12		zssinfcl.ss	. . . . . . . 8 |- ( ph -> B C_ ZZ )
13	12	adantr 270	. . . . . . 7 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> B C_ ZZ )
14		simprl 497	. . . . . . 7 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z e. B )
15	13, 14	sseldd 3000	. . . . . 6 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z e. ZZ )
16	15	zred 8469	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z e. RR )
17	7, 8	inflbti 6437	. . . . . . 7 |- ( ph -> ( z e. B -> -. z < inf ( B , RR , < ) ) )
18	17	imp 122	. . . . . 6 |- ( ( ph /\ z e. B ) -> -. z < inf ( B , RR , < ) )
19	18	adantrr 462	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> -. z < inf ( B , RR , < ) )
20	11, 16, 19	nltled 7230	. . . 4 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) <_ z )
21		simprr 498	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z < (inf ( B , RR , < ) + 1 ) )
22	1	adantr 270	. . . . . 6 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) e. ZZ )
23		zleltp1 8406	. . . . . 6 |- ( ( z e. ZZ /\ inf ( B , RR , < ) e. ZZ ) -> ( z <_ inf ( B , RR , < ) <-> z < (inf ( B , RR , < ) + 1 ) ) )
24	15, 22, 23	syl2anc 403	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> ( z <_ inf ( B , RR , < ) <-> z < (inf ( B , RR , < ) + 1 ) ) )
25	21, 24	mpbird 165	. . . 4 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z <_ inf ( B , RR , < ) )
26	11, 16	letri3d 7226	. . . 4 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> (inf ( B , RR , < ) = z <-> (inf ( B , RR , < ) <_ z /\ z <_ inf ( B , RR , < ) ) ) )
27	20, 25, 26	mpbir2and 885	. . 3 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) = z )
28	27, 14	eqeltrd 2155	. 2 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) e. B )
29	10, 28	rexlimddv 2481	1 |- ( ph -> inf ( B , RR , < ) e. B )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1284   e. wcel 1433   A.wral 2348   E.wrex 2349   C_ wss 2973   class class class wbr 3785  (class class class)co 5532  infcinf 6396   RRcr 6980   1c1 6982   + caddc 6984   < clt 7153   <_ cle 7154   ZZcz 8351

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-apti 7091  ax-pre-ltadd 7092

This theorem depends on definitions:  df-bi 115  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-reu 2355  df-rmo 2356  df-rab 2357  df-v 2603  df-sbc 2816  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-sup 6397  df-inf 6398  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-sub 7281  df-neg 7282  df-inn 8040  df-n0 8289  df-z 8352

This theorem is referenced by: (None)