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

Theorem xrmaxleim 11750
Description: Value of maximum when we know which extended real is larger. (Contributed by Jim Kingdon, 25-Apr-2023.)
Assertion
Ref Expression
xrmaxleim  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  B  ->  sup ( { A ,  B } ,  RR* ,  <  )  =  B ) )

Proof of Theorem xrmaxleim
Dummy variables  f  g  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xrlttri3 9989 . . . 4  |-  ( ( f  e.  RR*  /\  g  e.  RR* )  ->  (
f  =  g  <->  ( -.  f  <  g  /\  -.  g  <  f ) ) )
21adantl 277 . . 3  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  A  <_  B )  /\  (
f  e.  RR*  /\  g  e.  RR* ) )  -> 
( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
3 simplr 528 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  A  <_  B )  ->  B  e.  RR* )
4 prid2g 3771 . . . 4  |-  ( B  e.  RR*  ->  B  e. 
{ A ,  B } )
53, 4syl 14 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  A  <_  B )  ->  B  e.  { A ,  B }
)
6 simpllr 534 . . . . . 6  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  A  <_  B )
7 xrlenlt 8207 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  B  <->  -.  B  <  A ) )
87ad3antrrr 492 . . . . . 6  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  ( A  <_  B  <->  -.  B  <  A ) )
96, 8mpbid 147 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  A )
10 breq2 4086 . . . . . . 7  |-  ( y  =  A  ->  ( B  <  y  <->  B  <  A ) )
1110notbid 671 . . . . . 6  |-  ( y  =  A  ->  ( -.  B  <  y  <->  -.  B  <  A ) )
1211adantl 277 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  ( -.  B  <  y  <->  -.  B  <  A ) )
139, 12mpbird 167 . . . 4  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  y )
14 xrltnr 9971 . . . . . 6  |-  ( B  e.  RR*  ->  -.  B  <  B )
1514ad4antlr 495 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  B )
16 breq2 4086 . . . . . . 7  |-  ( y  =  B  ->  ( B  <  y  <->  B  <  B ) )
1716notbid 671 . . . . . 6  |-  ( y  =  B  ->  ( -.  B  <  y  <->  -.  B  <  B ) )
1817adantl 277 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  ( -.  B  <  y  <->  -.  B  <  B ) )
1915, 18mpbird 167 . . . 4  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  y )
20 elpri 3689 . . . . 5  |-  ( y  e.  { A ,  B }  ->  ( y  =  A  \/  y  =  B ) )
2120adantl 277 . . . 4  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  (
y  =  A  \/  y  =  B )
)
2213, 19, 21mpjaodan 803 . . 3  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  -.  B  <  y )
232, 3, 5, 22supmaxti 7167 . 2  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  A  <_  B )  ->  sup ( { A ,  B } ,  RR* ,  <  )  =  B )
2423ex 115 1  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  B  ->  sup ( { A ,  B } ,  RR* ,  <  )  =  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    = wceq 1395    e. wcel 2200   {cpr 3667   class class class wbr 4082   supcsup 7145   RR*cxr 8176    < clt 8177    <_ cle 8178
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-pre-ltirr 8107  ax-pre-apti 8110
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-xp 4724  df-cnv 4726  df-iota 5277  df-riota 5953  df-sup 7147  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183
This theorem is referenced by:  xrmaxltsup  11764  xrmaxadd  11767  xrmineqinf  11775
  Copyright terms: Public domain W3C validator