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

Theorem zssinfcl 10493
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 9602 . . . 4  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  RR )
3 1red 8194 . . . 4  |-  ( ph  ->  1  e.  RR )
42, 3readdcld 8209 . . 3  |-  ( ph  ->  (inf ( B ,  RR ,  <  )  +  1 )  e.  RR )
52ltp1d 9110 . . 3  |-  ( ph  -> inf ( B ,  RR ,  <  )  <  (inf ( B ,  RR ,  <  )  +  1 ) )
6 lttri3 8259 . . . . 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 7224 . . 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 531 . . . . . . 7  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  B
)
1513, 14sseldd 3228 . . . . . 6  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  ZZ )
1615zred 9602 . . . . 5  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  ->  z  e.  RR )
177, 8inflbti 7223 . . . . . . 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 8300 . . . 4  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  <_ 
z )
21 simprr 533 . . . . 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 9535 . . . . . 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 8295 . . . 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 952 . . 3  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  =  z )
2827, 14eqeltrd 2308 . 2  |-  ( (
ph  /\  ( z  e.  B  /\  z  <  (inf ( B ,  RR ,  <  )  +  1 ) ) )  -> inf ( B ,  RR ,  <  )  e.  B )
2910, 28rexlimddv 2655 1  |-  ( ph  -> inf ( B ,  RR ,  <  )  e.  B
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   A.wral 2510   E.wrex 2511    C_ wss 3200   class class class wbr 4088  (class class class)co 6018  infcinf 7182   RRcr 8031   1c1 8033    + caddc 8035    < clt 8214    <_ cle 8215   ZZcz 9479
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-sup 7183  df-inf 7184  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-inn 9144  df-n0 9403  df-z 9480
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator