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

Theorem suplocexpr 8082
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 4128 . . . . . 6  |-  ( a  =  w  ->  (
a  <Q  u  <->  w  <Q  u ) )
54cbvrexv 2787 . . . . 5  |-  ( E. a  e.  |^| ( 2nd " A ) a 
<Q  u  <->  E. w  e.  |^| ( 2nd " A ) w  <Q  u )
65rabbii 2808 . . . 4  |-  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u }  =  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u }
76opeq2i 3903 . . 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 8079 . 2  |-  ( ph  -> 
<. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  e.  P. )
91, 2, 3, 7suplocexprlemub 8080 . 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 8081 . . 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 2624 . 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 4128 . . . . . 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 677 . . . . 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 2550 . . . 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 4129 . . . . . 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 231 . . . . 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 2550 . . . 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 477 . . 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 2929 . 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 1276 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 104    \/ wo 720    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   <.cop 3708   U.cuni 3930   |^|cint 3965   class class class wbr 4125   "cima 4772   1stc1st 6362   2ndc2nd 6363   Q.cnq 7637    <Q cltq 7642   P.cnp 7648    <P cltp 7652
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-eprel 4429  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-1o 6677  df-2o 6678  df-oadd 6681  df-omul 6682  df-er 6797  df-ec 6799  df-qs 6803  df-ni 7661  df-pli 7662  df-mi 7663  df-lti 7664  df-plpq 7701  df-mpq 7702  df-enq 7704  df-nqqs 7705  df-plqqs 7706  df-mqqs 7707  df-1nqqs 7708  df-rq 7709  df-ltnqqs 7710  df-enq0 7781  df-nq0 7782  df-0nq0 7783  df-plq0 7784  df-mq0 7785  df-inp 7823  df-iltp 7827
This theorem is referenced by:  suplocsrlempr  8164
  Copyright terms: Public domain W3C validator