Theorem suplocexpr 8092

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.

Step	Hyp	Ref	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 4133	. . . . . 6 |- ( a = w -> ( a <Q u <-> w <Q u ) )
5	4	cbvrexv 2787	. . . . 5 |- ( E. a e. |^| ( 2nd " A ) a <Q u <-> E. w e. |^| ( 2nd " A ) w <Q u )
6	5	rabbii 2808	. . . 4 |- { u e. Q. | E. a e. |^| ( 2nd " A ) a <Q u } = { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u }
7	6	opeq2i 3908	. . 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 } >.
8	1, 2, 3, 7	suplocexprlemex 8089	. 2 |- ( ph -> <. U. ( 1st " A ) , { u e. Q. | E. a e. |^| ( 2nd " A ) a <Q u } >. e. P. )
9	1, 2, 3, 7	suplocexprlemub 8090	. 2 |- ( ph -> A. y e. A -. <. U. ( 1st " A ) , { u e. Q. | E. a e. |^| ( 2nd " A ) a <Q u } >. <P y )
10	1, 2, 3, 7	suplocexprlemlub 8091	. . 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 ) )
11	10	ralrimivw 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 4133	. . . . . 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 ) )
13	12	notbid 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 ) )
14	13	ralbidv 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 4134	. . . . . 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 } >. ) )
16	15	imbi1d 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 ) ) )
17	16	ralbidv 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 ) ) )
18	14, 17	anbi12d 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 ) ) ) )
19	18	rspcev 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 ) ) )
20	8, 9, 11, 19	syl12anc 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 ) ) )

This proof depends on syntax axioms:   -. 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 3712   U.cuni 3935   |^|cint 3970   class class class wbr 4130   "cima 4777   1stc1st 6372   2ndc2nd 6373   Q.cnq 7647   <Q cltq 7652   P.cnp 7658   <P cltp 7662

This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-iltp 7837

This theorem is used by:  suplocsrlempr  8174