ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  zssinfcl Unicode version

Theorem zssinfcl 11919
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.
StepHypRef Expression
1 zssinfcl.zz . . . . 5  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  ZZ )
21zred 9351 . . . 4  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  RR )
3 1red 7950 . . . 4  |-  ( ph  ->  1  e.  RR )
42, 3readdcld 7964 . . 3  |-  ( ph  ->  (inf ( B ,  RR ,  <  )  +  1 )  e.  RR )
52ltp1d 8863 . . 3  |-  ( ph  -> inf ( B ,  RR ,  <  )  <  (inf ( B ,  RR ,  <  )  +  1 ) )
6 lttri3 8014 . . . . 5  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
76adantl 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 ) ) )
97, 8infglbti 7017 . . 3  |-  ( ph  ->  ( ( (inf ( B ,  RR ,  <  )  +  1 )  e.  RR  /\ inf ( B ,  RR ,  <  )  <  (inf ( B ,  RR ,  <  )  +  1 ) )  ->  E. z  e.  B  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )
104, 5, 9mp2and 433 . 2  |-  ( ph  ->  E. z  e.  B  z  <  (inf ( B ,  RR ,  <  )  +  1 ) )
112adantr 276 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  RR )
12 zssinfcl.ss . . . . . . . 8  |-  ( ph  ->  B  C_  ZZ )
1312adantr 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
)
1513, 14sseldd 3156 . . . . . 6  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  ZZ )
1615zred 9351 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  RR )
177, 8inflbti 7016 . . . . . . 7  |-  ( ph  ->  ( z  e.  B  ->  -.  z  < inf ( B ,  RR ,  <  ) ) )
1817imp 124 . . . . . 6  |-  ( (
ph  /\  z  e.  B )  ->  -.  z  < inf ( B ,  RR ,  <  ) )
1918adantrr 479 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  -.  z  < inf ( B ,  RR ,  <  ) )
2011, 16, 19nltled 8055 . . . 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 ) )
221adantr 276 . . . . . 6  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  ZZ )
23 zleltp1 9284 . . . . . 6  |-  ( ( z  e.  ZZ  /\ inf ( B ,  RR ,  <  )  e.  ZZ )  ->  ( z  <_ inf ( B ,  RR ,  <  )  <->  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )
2415, 22, 23syl2anc 411 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  ( z  <_ inf ( B ,  RR ,  <  )  <->  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )
2521, 24mpbird 167 . . . 4  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  <_ inf ( B ,  RR ,  <  ) )
2611, 16letri3d 8050 . . . 4  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  (inf ( B ,  RR ,  <  )  =  z  <->  (inf ( B ,  RR ,  <  )  <_  z  /\  z  <_ inf ( B ,  RR ,  <  ) ) ) )
2720, 25, 26mpbir2and 944 . . 3  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  =  z )
2827, 14eqeltrd 2254 . 2  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  B )
2910, 28rexlimddv 2599 1  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  B
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2148   A.wral 2455   E.wrex 2456    C_ wss 3129   class class class wbr 4000  (class class class)co 5868  infcinf 6975   RRcr 7788   1c1 7790    + caddc 7792    < clt 7969    <_ cle 7970   ZZcz 9229
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4205  ax-un 4429  ax-setind 4532  ax-cnex 7880  ax-resscn 7881  ax-1cn 7882  ax-1re 7883  ax-icn 7884  ax-addcl 7885  ax-addrcl 7886  ax-mulcl 7887  ax-addcom 7889  ax-addass 7891  ax-distr 7893  ax-i2m1 7894  ax-0lt1 7895  ax-0id 7897  ax-rnegex 7898  ax-cnre 7900  ax-pre-ltirr 7901  ax-pre-ltwlin 7902  ax-pre-lttrn 7903  ax-pre-apti 7904  ax-pre-ltadd 7905
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-br 4001  df-opab 4062  df-id 4289  df-xp 4628  df-rel 4629  df-cnv 4630  df-co 4631  df-dm 4632  df-iota 5173  df-fun 5213  df-fv 5219  df-riota 5824  df-ov 5871  df-oprab 5872  df-mpo 5873  df-sup 6976  df-inf 6977  df-pnf 7971  df-mnf 7972  df-xr 7973  df-ltxr 7974  df-le 7975  df-sub 8107  df-neg 8108  df-inn 8896  df-n0 9153  df-z 9230
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator