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

Theorem suplocexpr 7666
Description: An inhabited, bounded-above, located set of positive reals has a supremum. (Contributed by Jim Kingdon, 7-Jan-2024.)
Hypotheses
Ref Expression
suplocexpr.m  |-  ( ph  ->  E. x  x  e.  A )
suplocexpr.ub  |-  ( ph  ->  E. x  e.  P.  A. y  e.  A  y 
<P  x )
suplocexpr.loc  |-  ( ph  ->  A. x  e.  P.  A. y  e.  P.  (
x  <P  y  ->  ( E. z  e.  A  x  <P  z  \/  A. z  e.  A  z  <P  y ) ) )
Assertion
Ref Expression
suplocexpr  |-  ( ph  ->  E. x  e.  P.  ( A. y  e.  A  -.  x  <P  y  /\  A. y  e.  P.  (
y  <P  x  ->  E. z  e.  A  y  <P  z ) ) )
Distinct variable groups:    y, A, z, x    ph, y, z, x

Proof of Theorem suplocexpr
Dummy variables  a  u  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suplocexpr.m . . 3  |-  ( ph  ->  E. x  x  e.  A )
2 suplocexpr.ub . . 3  |-  ( ph  ->  E. x  e.  P.  A. y  e.  A  y 
<P  x )
3 suplocexpr.loc . . 3  |-  ( ph  ->  A. x  e.  P.  A. y  e.  P.  (
x  <P  y  ->  ( E. z  e.  A  x  <P  z  \/  A. z  e.  A  z  <P  y ) ) )
4 breq1 3985 . . . . . 6  |-  ( a  =  w  ->  (
a  <Q  u  <->  w  <Q  u ) )
54cbvrexv 2693 . . . . 5  |-  ( E. a  e.  |^| ( 2nd " A ) a 
<Q  u  <->  E. w  e.  |^| ( 2nd " A ) w  <Q  u )
65rabbii 2712 . . . 4  |-  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u }  =  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u }
76opeq2i 3762 . . 3  |-  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >.  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u } >.
81, 2, 3, 7suplocexprlemex 7663 . 2  |-  ( ph  -> 
<. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  e.  P. )
91, 2, 3, 7suplocexprlemub 7664 . 2  |-  ( ph  ->  A. y  e.  A  -.  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  <P  y )
101, 2, 3, 7suplocexprlemlub 7665 . . 3  |-  ( ph  ->  ( y  <P  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >.  ->  E. z  e.  A  y  <P  z ) )
1110ralrimivw 2540 . 2  |-  ( ph  ->  A. y  e.  P.  ( y  <P  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >.  ->  E. z  e.  A  y  <P  z ) )
12 breq1 3985 . . . . . 6  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( x  <P  y  <->  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  <P  y ) )
1312notbid 657 . . . . 5  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( -.  x  <P  y  <->  -.  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >.  <P  y ) )
1413ralbidv 2466 . . . 4  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( A. y  e.  A  -.  x  <P  y  <->  A. y  e.  A  -.  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >.  <P  y ) )
15 breq2 3986 . . . . . 6  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( y  <P  x  <->  y  <P  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >. ) )
1615imbi1d 230 . . . . 5  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( (
y  <P  x  ->  E. z  e.  A  y  <P  z )  <->  ( y  <P  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  E. z  e.  A  y  <P  z ) ) )
1716ralbidv 2466 . . . 4  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( A. y  e.  P.  (
y  <P  x  ->  E. z  e.  A  y  <P  z )  <->  A. y  e.  P.  ( y  <P  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A ) a  <Q  u } >.  ->  E. z  e.  A  y  <P  z ) ) )
1814, 17anbi12d 465 . . 3  |-  ( x  =  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  ( ( A. y  e.  A  -.  x  <P  y  /\  A. y  e.  P.  (
y  <P  x  ->  E. z  e.  A  y  <P  z ) )  <->  ( A. y  e.  A  -.  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  <P  y  /\  A. y  e.  P.  (
y  <P  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  E. z  e.  A  y  <P  z ) ) ) )
1918rspcev 2830 . 2  |-  ( (
<. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  e.  P.  /\  ( A. y  e.  A  -.  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  <P  y  /\  A. y  e.  P.  (
y  <P  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  ->  E. z  e.  A  y  <P  z ) ) )  ->  E. x  e.  P.  ( A. y  e.  A  -.  x  <P  y  /\  A. y  e.  P.  (
y  <P  x  ->  E. z  e.  A  y  <P  z ) ) )
208, 9, 11, 19syl12anc 1226 1  |-  ( ph  ->  E. x  e.  P.  ( A. y  e.  A  -.  x  <P  y  /\  A. y  e.  P.  (
y  <P  x  ->  E. z  e.  A  y  <P  z ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    \/ wo 698    = wceq 1343   E.wex 1480    e. wcel 2136   A.wral 2444   E.wrex 2445   {crab 2448   <.cop 3579   U.cuni 3789   |^|cint 3824   class class class wbr 3982   "cima 4607   1stc1st 6106   2ndc2nd 6107   Q.cnq 7221    <Q cltq 7226   P.cnp 7232    <P cltp 7236
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-eprel 4267  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-1o 6384  df-2o 6385  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-pli 7246  df-mi 7247  df-lti 7248  df-plpq 7285  df-mpq 7286  df-enq 7288  df-nqqs 7289  df-plqqs 7290  df-mqqs 7291  df-1nqqs 7292  df-rq 7293  df-ltnqqs 7294  df-enq0 7365  df-nq0 7366  df-0nq0 7367  df-plq0 7368  df-mq0 7369  df-inp 7407  df-iltp 7411
This theorem is referenced by:  suplocsrlempr  7748
  Copyright terms: Public domain W3C validator