Theorem xrmaxiflemval 12016

Description: Lemma for xrmaxif 12017. Value of the supremum. (Contributed by Jim Kingdon, 29-Apr-2023.)

Hypothesis

Ref	Expression
xrmaxiflemval.m	|- M = if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) )

Assertion

Ref	Expression
xrmaxiflemval	|- ( ( A e. RR* /\ B e. RR* ) -> ( M e. RR* /\ A. x e. { A , B } -. M < x /\ A. x e. RR* ( x < M -> E. z e. { A , B } x < z ) ) )

Distinct variable groups:   x, A, z   x, B, z

Allowed substitution hints:   M( x, z)

Proof of Theorem xrmaxiflemval

Step	Hyp	Ref	Expression
1		xrmaxiflemval.m	. . 3 |- M = if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) )
2		xrmaxiflemcl 12011	. . 3 |- ( ( A e. RR* /\ B e. RR* ) -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) e. RR* )
3	1, 2	eqeltrid 2325	. 2 |- ( ( A e. RR* /\ B e. RR* ) -> M e. RR* )
4		vex 2824	. . . . 5 |- x e. _V
5	4	elpr 3730	. . . 4 |- ( x e. { A , B } <-> ( x = A \/ x = B ) )
6		xrmaxifle 12012	. . . . . . . 8 |- ( ( A e. RR* /\ B e. RR* ) -> A <_ if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )
7	6, 1	breqtrrdi 4172	. . . . . . 7 |- ( ( A e. RR* /\ B e. RR* ) -> A <_ M )
8		xrlenlt 8390	. . . . . . . 8 |- ( ( A e. RR* /\ M e. RR* ) -> ( A <_ M <-> -. M < A ) )
9	3, 8	syldan 282	. . . . . . 7 |- ( ( A e. RR* /\ B e. RR* ) -> ( A <_ M <-> -. M < A ) )
10	7, 9	mpbid 147	. . . . . 6 |- ( ( A e. RR* /\ B e. RR* ) -> -. M < A )
11		breq2 4134	. . . . . . 7 |- ( x = A -> ( M < x <-> M < A ) )
12	11	notbid 677	. . . . . 6 |- ( x = A -> ( -. M < x <-> -. M < A ) )
13	10, 12	syl5ibrcom 157	. . . . 5 |- ( ( A e. RR* /\ B e. RR* ) -> ( x = A -> -. M < x ) )
14		xrmaxifle 12012	. . . . . . . . 9 |- ( ( B e. RR* /\ A e. RR* ) -> B <_ if ( A = +oo , +oo , if ( A = -oo , B , if ( B = +oo , +oo , if ( B = -oo , A , sup ( { B , A } , RR , < ) ) ) ) ) )
15	14	ancoms 268	. . . . . . . 8 |- ( ( A e. RR* /\ B e. RR* ) -> B <_ if ( A = +oo , +oo , if ( A = -oo , B , if ( B = +oo , +oo , if ( B = -oo , A , sup ( { B , A } , RR , < ) ) ) ) ) )
16		xrmaxiflemcom 12015	. . . . . . . . 9 |- ( ( A e. RR* /\ B e. RR* ) -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) = if ( A = +oo , +oo , if ( A = -oo , B , if ( B = +oo , +oo , if ( B = -oo , A , sup ( { B , A } , RR , < ) ) ) ) ) )
17	1, 16	eqtrid 2283	. . . . . . . 8 |- ( ( A e. RR* /\ B e. RR* ) -> M = if ( A = +oo , +oo , if ( A = -oo , B , if ( B = +oo , +oo , if ( B = -oo , A , sup ( { B , A } , RR , < ) ) ) ) ) )
18	15, 17	breqtrrd 4158	. . . . . . 7 |- ( ( A e. RR* /\ B e. RR* ) -> B <_ M )
19		simpr 110	. . . . . . . 8 |- ( ( A e. RR* /\ B e. RR* ) -> B e. RR* )
20		xrlenlt 8390	. . . . . . . 8 |- ( ( B e. RR* /\ M e. RR* ) -> ( B <_ M <-> -. M < B ) )
21	19, 3, 20	syl2anc 415	. . . . . . 7 |- ( ( A e. RR* /\ B e. RR* ) -> ( B <_ M <-> -. M < B ) )
22	18, 21	mpbid 147	. . . . . 6 |- ( ( A e. RR* /\ B e. RR* ) -> -. M < B )
23		breq2 4134	. . . . . . 7 |- ( x = B -> ( M < x <-> M < B ) )
24	23	notbid 677	. . . . . 6 |- ( x = B -> ( -. M < x <-> -. M < B ) )
25	22, 24	syl5ibrcom 157	. . . . 5 |- ( ( A e. RR* /\ B e. RR* ) -> ( x = B -> -. M < x ) )
26	13, 25	jaod 729	. . . 4 |- ( ( A e. RR* /\ B e. RR* ) -> ( ( x = A \/ x = B ) -> -. M < x ) )
27	5, 26	biimtrid 152	. . 3 |- ( ( A e. RR* /\ B e. RR* ) -> ( x e. { A , B } -> -. M < x ) )
28	27	ralrimiv 2622	. 2 |- ( ( A e. RR* /\ B e. RR* ) -> A. x e. { A , B } -. M < x )
29		prid1g 3815	. . . . . . 7 |- ( A e. RR* -> A e. { A , B } )
30	29	ad4antr 498	. . . . . 6 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) /\ x < A ) -> A e. { A , B } )
31		breq2 4134	. . . . . . 7 |- ( z = A -> ( x < z <-> x < A ) )
32	31	rspcev 2929	. . . . . 6 |- ( ( A e. { A , B } /\ x < A ) -> E. z e. { A , B } x < z )
33	30, 32	sylancom 424	. . . . 5 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) /\ x < A ) -> E. z e. { A , B } x < z )
34		prid2g 3816	. . . . . . 7 |- ( B e. RR* -> B e. { A , B } )
35	34	ad4antlr 499	. . . . . 6 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) /\ x < B ) -> B e. { A , B } )
36		breq2 4134	. . . . . . 7 |- ( z = B -> ( x < z <-> x < B ) )
37	36	rspcev 2929	. . . . . 6 |- ( ( B e. { A , B } /\ x < B ) -> E. z e. { A , B } x < z )
38	35, 37	sylancom 424	. . . . 5 |- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) /\ x < B ) -> E. z e. { A , B } x < z )
39		simplll 539	. . . . . 6 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) -> A e. RR* )
40		simpllr 540	. . . . . 6 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) -> B e. RR* )
41		simplr 533	. . . . . 6 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) -> x e. RR* )
42	1	breq2i 4138	. . . . . . . 8 |- ( x < M <-> x < if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )
43	42	biimpi 120	. . . . . . 7 |- ( x < M -> x < if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )
44	43	adantl 277	. . . . . 6 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) -> x < if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )
45	39, 40, 41, 44	xrmaxiflemlub 12014	. . . . 5 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) -> ( x < A \/ x < B ) )
46	33, 38, 45	mpjaodan 810	. . . 4 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) /\ x < M ) -> E. z e. { A , B } x < z )
47	46	ex 115	. . 3 |- ( ( ( A e. RR* /\ B e. RR* ) /\ x e. RR* ) -> ( x < M -> E. z e. { A , B } x < z ) )
48	47	ralrimiva 2623	. 2 |- ( ( A e. RR* /\ B e. RR* ) -> A. x e. RR* ( x < M -> E. z e. { A , B } x < z ) )
49	3, 28, 48	3jca 1208	1 |- ( ( A e. RR* /\ B e. RR* ) -> ( M e. RR* /\ A. x e. { A , B } -. M < x /\ A. x e. RR* ( x < M -> E. z e. { A , B } x < z ) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   ifcif 3638   {cpr 3710   class class class wbr 4130   supcsup 7322   RRcr 8178   +oocpnf 8357   -oocmnf 8358   RR*cxr 8359   < clt 8360   <_ cle 8361

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  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

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-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  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-if 3639  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-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  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-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-sup 7324  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-rp 10055  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765

This theorem is used by:  xrmaxif  12017