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

Theorem suprlubex 8713
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 7847 . . . 4  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
32adantl 275 . . 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 7845 . . . 4  |-  <  Or  RR
65a1i 9 . . 3  |-  ( ph  ->  <  Or  RR )
7 suprubex.ss . . 3  |-  ( ph  ->  A  C_  RR )
83, 4, 6, 7suplub2ti 6888 . 2  |-  ( (
ph  /\  B  e.  RR )  ->  ( B  <  sup ( A ,  RR ,  <  )  <->  E. z  e.  A  B  <  z ) )
91, 8mpdan 417 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 103    <-> wb 104    e. wcel 1480   A.wral 2416   E.wrex 2417    C_ wss 3071   class class class wbr 3929    Or wor 4217   supcsup 6869   RRcr 7622    < clt 7803
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7714  ax-resscn 7715  ax-pre-ltirr 7735  ax-pre-ltwlin 7736  ax-pre-lttrn 7737  ax-pre-apti 7738
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-po 4218  df-iso 4219  df-xp 4545  df-iota 5088  df-riota 5730  df-sup 6871  df-pnf 7805  df-mnf 7806  df-ltxr 7808
This theorem is referenced by:  suprnubex  8714  suprzclex  9152
  Copyright terms: Public domain W3C validator