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

Theorem zssinfcl 11903
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 9334 . . . 4  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  RR )
3 1red 7935 . . . 4  |-  ( ph  ->  1  e.  RR )
42, 3readdcld 7949 . . 3  |-  ( ph  ->  (inf ( B ,  RR ,  <  )  +  1 )  e.  RR )
52ltp1d 8846 . . 3  |-  ( ph  -> inf ( B ,  RR ,  <  )  <  (inf ( B ,  RR ,  <  )  +  1 ) )
6 lttri3 7999 . . . . 5  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
76adantl 275 . . . 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 7002 . . 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 431 . 2  |-  ( ph  ->  E. z  e.  B  z  <  (inf ( B ,  RR ,  <  )  +  1 ) )
112adantr 274 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  RR )
12 zssinfcl.ss . . . . . . . 8  |-  ( ph  ->  B  C_  ZZ )
1312adantr 274 . . . . . . 7  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  B  C_  ZZ )
14 simprl 526 . . . . . . 7  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  B
)
1513, 14sseldd 3148 . . . . . 6  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  ZZ )
1615zred 9334 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  RR )
177, 8inflbti 7001 . . . . . . 7  |-  ( ph  ->  ( z  e.  B  ->  -.  z  < inf ( B ,  RR ,  <  ) ) )
1817imp 123 . . . . . 6  |-  ( (
ph  /\  z  e.  B )  ->  -.  z  < inf ( B ,  RR ,  <  ) )
1918adantrr 476 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  -.  z  < inf ( B ,  RR ,  <  ) )
2011, 16, 19nltled 8040 . . . 4  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  <_ 
z )
21 simprr 527 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  <  (inf ( B ,  RR ,  <  )  +  1 ) )
221adantr 274 . . . . . 6  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  ZZ )
23 zleltp1 9267 . . . . . 6  |-  ( ( z  e.  ZZ  /\ inf ( B ,  RR ,  <  )  e.  ZZ )  ->  ( z  <_ inf ( B ,  RR ,  <  )  <->  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )
2415, 22, 23syl2anc 409 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  ( z  <_ inf ( B ,  RR ,  <  )  <->  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )
2521, 24mpbird 166 . . . 4  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  <_ inf ( B ,  RR ,  <  ) )
2611, 16letri3d 8035 . . . 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 939 . . 3  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  =  z )
2827, 14eqeltrd 2247 . 2  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  B )
2910, 28rexlimddv 2592 1  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  B
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141   A.wral 2448   E.wrex 2449    C_ wss 3121   class class class wbr 3989  (class class class)co 5853  infcinf 6960   RRcr 7773   1c1 7775    + caddc 7777    < clt 7954    <_ cle 7955   ZZcz 9212
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890
This theorem depends on definitions:  df-bi 116  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-sup 6961  df-inf 6962  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator