Theorem suplocexpr 8005

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 4096	. . . . . 6 |- ( a = w -> ( a <Q u <-> w <Q u ) )
5	4	cbvrexv 2769	. . . . 5 |- ( E. a e. |^| ( 2nd " A ) a <Q u <-> E. w e. |^| ( 2nd " A ) w <Q u )
6	5	rabbii 2790	. . . 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 3871	. . 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 8002	. 2 |- ( ph -> <. U. ( 1st " A ) , { u e. Q. | E. a e. |^| ( 2nd " A ) a <Q u } >. e. P. )
9	1, 2, 3, 7	suplocexprlemub 8003	. 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 8004	. . 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 2607	. 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 4096	. . . . . 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 673	. . . . 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 2533	. . . 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 4097	. . . . . 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 2533	. . . 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 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 ) ) ) )
19	18	rspcev 2911	. 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 1272	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 ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 716   = wceq 1398   E.wex 1541   e. wcel 2202   A.wral 2511   E.wrex 2512   {crab 2515   <.cop 3676   U.cuni 3898   |^|cint 3933   class class class wbr 4093   "cima 4734   1stc1st 6310   2ndc2nd 6311   Q.cnq 7560   <Q cltq 7565   P.cnp 7571   <P cltp 7575

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-2o 6626  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7584  df-pli 7585  df-mi 7586  df-lti 7587  df-plpq 7624  df-mpq 7625  df-enq 7627  df-nqqs 7628  df-plqqs 7629  df-mqqs 7630  df-1nqqs 7631  df-rq 7632  df-ltnqqs 7633  df-enq0 7704  df-nq0 7705  df-0nq0 7706  df-plq0 7707  df-mq0 7708  df-inp 7746  df-iltp 7750

This theorem is referenced by:  suplocsrlempr  8087