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

Theorem suprubex 8029
Description: A member of a nonempty bounded set of reals is less than or equal to the set's upper bound. (Contributed by Jim Kingdon, 18-Jan-2022.)
Hypotheses
Ref Expression
suprubex.ex  |-  ( ph  ->  E. x  e.  RR  ( A. y  e.  A  -.  x  <  y  /\  A. y  e.  RR  (
y  <  x  ->  E. z  e.  A  y  <  z ) ) )
suprubex.ss  |-  ( ph  ->  A  C_  RR )
suprubex.b  |-  ( ph  ->  B  e.  A )
Assertion
Ref Expression
suprubex  |-  ( ph  ->  B  <_  sup ( A ,  RR ,  <  ) )
Distinct variable groups:    x, A, y, z    ph, x
Allowed substitution hints:    ph( y, z)    B( x, y, z)

Proof of Theorem suprubex
Dummy variables  f  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suprubex.ss . . 3  |-  ( ph  ->  A  C_  RR )
2 suprubex.b . . 3  |-  ( ph  ->  B  e.  A )
31, 2sseldd 3000 . 2  |-  ( ph  ->  B  e.  RR )
4 lttri3 7191 . . . 4  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
54adantl 271 . . 3  |-  ( (
ph  /\  ( f  e.  RR  /\  g  e.  RR ) )  -> 
( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
6 suprubex.ex . . 3  |-  ( ph  ->  E. x  e.  RR  ( A. y  e.  A  -.  x  <  y  /\  A. y  e.  RR  (
y  <  x  ->  E. z  e.  A  y  <  z ) ) )
75, 6supclti 6411 . 2  |-  ( ph  ->  sup ( A ,  RR ,  <  )  e.  RR )
85, 6supubti 6412 . . 3  |-  ( ph  ->  ( B  e.  A  ->  -.  sup ( A ,  RR ,  <  )  <  B ) )
92, 8mpd 13 . 2  |-  ( ph  ->  -.  sup ( A ,  RR ,  <  )  <  B )
103, 7, 9nltled 7230 1  |-  ( ph  ->  B  <_  sup ( A ,  RR ,  <  ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    <-> wb 103    e. wcel 1433   A.wral 2348   E.wrex 2349    C_ wss 2973   class class class wbr 3785   supcsup 6395   RRcr 6980    < clt 7153    <_ cle 7154
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-pre-ltirr 7088  ax-pre-apti 7091
This theorem depends on definitions:  df-bi 115  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-br 3786  df-opab 3840  df-xp 4369  df-cnv 4371  df-iota 4887  df-riota 5488  df-sup 6397  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159
This theorem is referenced by:  suprzclex  8445
  Copyright terms: Public domain W3C validator