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

Theorem suplocexpr 7785
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 4032 . . . . . 6  |-  ( a  =  w  ->  (
a  <Q  u  <->  w  <Q  u ) )
54cbvrexv 2727 . . . . 5  |-  ( E. a  e.  |^| ( 2nd " A ) a 
<Q  u  <->  E. w  e.  |^| ( 2nd " A ) w  <Q  u )
65rabbii 2746 . . . 4  |-  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u }  =  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u }
76opeq2i 3808 . . 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 7782 . 2  |-  ( ph  -> 
<. U. ( 1st " A
) ,  { u  e.  Q.  |  E. a  e.  |^| ( 2nd " A
) a  <Q  u } >.  e.  P. )
91, 2, 3, 7suplocexprlemub 7783 . 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 7784 . . 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 2568 . 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 4032 . . . . . 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 668 . . . . 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 2494 . . . 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 4033 . . . . . 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 2494 . . . 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 473 . . 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 2864 . 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 1247 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 709    = wceq 1364   E.wex 1503    e. wcel 2164   A.wral 2472   E.wrex 2473   {crab 2476   <.cop 3621   U.cuni 3835   |^|cint 3870   class class class wbr 4029   "cima 4662   1stc1st 6191   2ndc2nd 6192   Q.cnq 7340    <Q cltq 7345   P.cnp 7351    <P cltp 7355
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-eprel 4320  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-irdg 6423  df-1o 6469  df-2o 6470  df-oadd 6473  df-omul 6474  df-er 6587  df-ec 6589  df-qs 6593  df-ni 7364  df-pli 7365  df-mi 7366  df-lti 7367  df-plpq 7404  df-mpq 7405  df-enq 7407  df-nqqs 7408  df-plqqs 7409  df-mqqs 7410  df-1nqqs 7411  df-rq 7412  df-ltnqqs 7413  df-enq0 7484  df-nq0 7485  df-0nq0 7486  df-plq0 7487  df-mq0 7488  df-inp 7526  df-iltp 7530
This theorem is referenced by:  suplocsrlempr  7867
  Copyright terms: Public domain W3C validator