Theorem suplocexpr 7944

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 4091	. . . . . 6 |- ( a = w -> ( a <Q u <-> w <Q u ) )
5	4	cbvrexv 2768	. . . . 5 |- ( E. a e. |^| ( 2nd " A ) a <Q u <-> E. w e. |^| ( 2nd " A ) w <Q u )
6	5	rabbii 2789	. . . 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 3866	. . 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 7941	. 2 |- ( ph -> <. U. ( 1st " A ) , { u e. Q. | E. a e. |^| ( 2nd " A ) a <Q u } >. e. P. )
9	1, 2, 3, 7	suplocexprlemub 7942	. 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 7943	. . 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 2606	. 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 4091	. . . . . 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 2532	. . . 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 4092	. . . . . 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 2532	. . . 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 2910	. 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 1271	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 715   = wceq 1397   E.wex 1540   e. wcel 2202   A.wral 2510   E.wrex 2511   {crab 2514   <.cop 3672   U.cuni 3893   |^|cint 3928   class class class wbr 4088   "cima 4728   1stc1st 6300   2ndc2nd 6301   Q.cnq 7499   <Q cltq 7504   P.cnp 7510   <P cltp 7514

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-2o 6582  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-pli 7524  df-mi 7525  df-lti 7526  df-plpq 7563  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-plqqs 7568  df-mqqs 7569  df-1nqqs 7570  df-rq 7571  df-ltnqqs 7572  df-enq0 7643  df-nq0 7644  df-0nq0 7645  df-plq0 7646  df-mq0 7647  df-inp 7685  df-iltp 7689

This theorem is referenced by:  suplocsrlempr  8026