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

Theorem xrmaxiflemval 11415
Description: Lemma for xrmaxif 11416. 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
StepHypRef 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 11410 . . 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* )
31, 2eqeltrid 2283 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  M  e.  RR* )
4 vex 2766 . . . . 5  |-  x  e. 
_V
54elpr 3643 . . . 4  |-  ( x  e.  { A ,  B }  <->  ( x  =  A  \/  x  =  B ) )
6 xrmaxifle 11411 . . . . . . . 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 ,  <  ) ) ) ) ) )
76, 1breqtrrdi 4075 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A  <_  M )
8 xrlenlt 8091 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  M  e.  RR* )  ->  ( A  <_  M  <->  -.  M  <  A ) )
93, 8syldan 282 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  M  <->  -.  M  <  A ) )
107, 9mpbid 147 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  -.  M  <  A )
11 breq2 4037 . . . . . . 7  |-  ( x  =  A  ->  ( M  <  x  <->  M  <  A ) )
1211notbid 668 . . . . . 6  |-  ( x  =  A  ->  ( -.  M  <  x  <->  -.  M  <  A ) )
1310, 12syl5ibrcom 157 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
x  =  A  ->  -.  M  <  x ) )
14 xrmaxifle 11411 . . . . . . . . 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 ,  <  ) ) ) ) ) )
1514ancoms 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 11414 . . . . . . . . 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 ,  <  )
) ) ) ) )
171, 16eqtrid 2241 . . . . . . . 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 ,  <  ) ) ) ) ) )
1815, 17breqtrrd 4061 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  B  <_  M )
19 simpr 110 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  B  e.  RR* )
20 xrlenlt 8091 . . . . . . . 8  |-  ( ( B  e.  RR*  /\  M  e.  RR* )  ->  ( B  <_  M  <->  -.  M  <  B ) )
2119, 3, 20syl2anc 411 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <_  M  <->  -.  M  <  B ) )
2218, 21mpbid 147 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  -.  M  <  B )
23 breq2 4037 . . . . . . 7  |-  ( x  =  B  ->  ( M  <  x  <->  M  <  B ) )
2423notbid 668 . . . . . 6  |-  ( x  =  B  ->  ( -.  M  <  x  <->  -.  M  <  B ) )
2522, 24syl5ibrcom 157 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
x  =  B  ->  -.  M  <  x ) )
2613, 25jaod 718 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( x  =  A  \/  x  =  B )  ->  -.  M  <  x ) )
275, 26biimtrid 152 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
x  e.  { A ,  B }  ->  -.  M  <  x ) )
2827ralrimiv 2569 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A. x  e.  { A ,  B }  -.  M  <  x
)
29 prid1g 3726 . . . . . . 7  |-  ( A  e.  RR*  ->  A  e. 
{ A ,  B } )
3029ad4antr 494 . . . . . 6  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  A )  ->  A  e.  { A ,  B } )
31 breq2 4037 . . . . . . 7  |-  ( z  =  A  ->  (
x  <  z  <->  x  <  A ) )
3231rspcev 2868 . . . . . 6  |-  ( ( A  e.  { A ,  B }  /\  x  <  A )  ->  E. z  e.  { A ,  B } x  <  z )
3330, 32sylancom 420 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  A )  ->  E. z  e.  { A ,  B } x  <  z )
34 prid2g 3727 . . . . . . 7  |-  ( B  e.  RR*  ->  B  e. 
{ A ,  B } )
3534ad4antlr 495 . . . . . 6  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  B )  ->  B  e.  { A ,  B } )
36 breq2 4037 . . . . . . 7  |-  ( z  =  B  ->  (
x  <  z  <->  x  <  B ) )
3736rspcev 2868 . . . . . 6  |-  ( ( B  e.  { A ,  B }  /\  x  <  B )  ->  E. z  e.  { A ,  B } x  <  z )
3835, 37sylancom 420 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  B )  ->  E. z  e.  { A ,  B } x  <  z )
39 simplll 533 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  A  e.  RR* )
40 simpllr 534 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  B  e.  RR* )
41 simplr 528 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  x  e.  RR* )
421breq2i 4041 . . . . . . . 8  |-  ( x  <  M  <->  x  <  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) ) )
4342biimpi 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 ,  <  ) ) ) ) ) )
4443adantl 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 ,  <  ) ) ) ) ) )
4539, 40, 41, 44xrmaxiflemlub 11413 . . . . 5  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  (
x  <  A  \/  x  <  B ) )
4633, 38, 45mpjaodan 799 . . . 4  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  E. z  e.  { A ,  B } x  <  z )
4746ex 115 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( x  <  M  ->  E. z  e.  { A ,  B }
x  <  z )
)
4847ralrimiva 2570 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A. x  e.  RR*  ( x  < 
M  ->  E. z  e.  { A ,  B } x  <  z ) )
493, 28, 483jca 1179 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 ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 709    /\ w3a 980    = wceq 1364    e. wcel 2167   A.wral 2475   E.wrex 2476   ifcif 3561   {cpr 3623   class class class wbr 4033   supcsup 7048   RRcr 7878   +oocpnf 8058   -oocmnf 8059   RR*cxr 8060    < clt 8061    <_ cle 8062
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997  ax-arch 7998  ax-caucvg 7999
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 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-sup 7050  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-2 9049  df-3 9050  df-4 9051  df-n0 9250  df-z 9327  df-uz 9602  df-rp 9729  df-seqfrec 10540  df-exp 10631  df-cj 11007  df-re 11008  df-im 11009  df-rsqrt 11163  df-abs 11164
This theorem is referenced by:  xrmaxif  11416
  Copyright terms: Public domain W3C validator