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

Theorem suprlubex 8912
Description: The supremum of a nonempty bounded set of reals is the least upper bound. (Contributed by Jim Kingdon, 19-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 )
suprlubex.b  |-  ( ph  ->  B  e.  RR )
Assertion
Ref Expression
suprlubex  |-  ( ph  ->  ( B  <  sup ( A ,  RR ,  <  )  <->  E. z  e.  A  B  <  z ) )
Distinct variable groups:    x, A, y, z    ph, x    z, B
Allowed substitution hints:    ph( y, z)    B( x, y)

Proof of Theorem suprlubex
Dummy variables  f  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suprlubex.b . 2  |-  ( ph  ->  B  e.  RR )
2 lttri3 8040 . . . 4  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
32adantl 277 . . 3  |-  ( (
ph  /\  ( f  e.  RR  /\  g  e.  RR ) )  -> 
( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
4 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 ) ) )
5 ltso 8038 . . . 4  |-  <  Or  RR
65a1i 9 . . 3  |-  ( ph  ->  <  Or  RR )
7 suprubex.ss . . 3  |-  ( ph  ->  A  C_  RR )
83, 4, 6, 7suplub2ti 7003 . 2  |-  ( (
ph  /\  B  e.  RR )  ->  ( B  <  sup ( A ,  RR ,  <  )  <->  E. z  e.  A  B  <  z ) )
91, 8mpdan 421 1  |-  ( ph  ->  ( B  <  sup ( A ,  RR ,  <  )  <->  E. z  e.  A  B  <  z ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2148   A.wral 2455   E.wrex 2456    C_ wss 3131   class class class wbr 4005    Or wor 4297   supcsup 6984   RRcr 7813    < clt 7995
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 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7905  ax-resscn 7906  ax-pre-ltirr 7926  ax-pre-ltwlin 7927  ax-pre-lttrn 7928  ax-pre-apti 7929
This theorem depends on definitions:  df-bi 117  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 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-po 4298  df-iso 4299  df-xp 4634  df-iota 5180  df-riota 5834  df-sup 6986  df-pnf 7997  df-mnf 7998  df-ltxr 8000
This theorem is referenced by:  suprnubex  8913  suprzclex  9354
  Copyright terms: Public domain W3C validator