Theorem zssinfcl 12085

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 9439	. . . 4 |- ( ph -> inf ( B , RR , < ) e. RR )
3		1red 8034	. . . 4 |- ( ph -> 1 e. RR )
4	2, 3	readdcld 8049	. . 3 |- ( ph -> (inf ( B , RR , < ) + 1 ) e. RR )
5	2	ltp1d 8949	. . 3 |- ( ph -> inf ( B , RR , < ) < (inf ( B , RR , < ) + 1 ) )
6		lttri3 8099	. . . . 5 |- ( ( f e. RR /\ g e. RR ) -> ( f = g <-> ( -. f < g /\ -. g < f ) ) )
7	6	adantl 277	. . . 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 7084	. . 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 433	. 2 |- ( ph -> E. z e. B z < (inf ( B , RR , < ) + 1 ) )
11	2	adantr 276	. . . . 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 276	. . . . . . 7 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> B C_ ZZ )
14		simprl 529	. . . . . . 7 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z e. B )
15	13, 14	sseldd 3180	. . . . . 6 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z e. ZZ )
16	15	zred 9439	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z e. RR )
17	7, 8	inflbti 7083	. . . . . . 7 |- ( ph -> ( z e. B -> -. z < inf ( B , RR , < ) ) )
18	17	imp 124	. . . . . 6 |- ( ( ph /\ z e. B ) -> -. z < inf ( B , RR , < ) )
19	18	adantrr 479	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> -. z < inf ( B , RR , < ) )
20	11, 16, 19	nltled 8140	. . . 4 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) <_ z )
21		simprr 531	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z < (inf ( B , RR , < ) + 1 ) )
22	1	adantr 276	. . . . . 6 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) e. ZZ )
23		zleltp1 9372	. . . . . 6 |- ( ( z e. ZZ /\ inf ( B , RR , < ) e. ZZ ) -> ( z <_ inf ( B , RR , < ) <-> z < (inf ( B , RR , < ) + 1 ) ) )
24	15, 22, 23	syl2anc 411	. . . . 5 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> ( z <_ inf ( B , RR , < ) <-> z < (inf ( B , RR , < ) + 1 ) ) )
25	21, 24	mpbird 167	. . . 4 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> z <_ inf ( B , RR , < ) )
26	11, 16	letri3d 8135	. . . 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 946	. . 3 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) = z )
28	27, 14	eqeltrd 2270	. 2 |- ( ( ph /\ ( z e. B /\ z < (inf ( B , RR , < ) + 1 ) ) ) -> inf ( B , RR , < ) e. B )
29	10, 28	rexlimddv 2616	1 |- ( ph -> inf ( B , RR , < ) e. B )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2164   A.wral 2472   E.wrex 2473   C_ wss 3153   class class class wbr 4029  (class class class)co 5918  infcinf 7042   RRcr 7871   1c1 7873   + caddc 7875   < clt 8054   <_ cle 8055   ZZcz 9317

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-sup 7043  df-inf 7044  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-inn 8983  df-n0 9241  df-z 9318

This theorem is referenced by: (None)