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

Theorem xrmaxleim 11390
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 9866 . . . 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 3724 . . . 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 8086 . . . . . . 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 4034 . . . . . . 7  |-  ( y  =  A  ->  ( B  <  y  <->  B  <  A ) )
1110notbid 668 . . . . . 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 9848 . . . . . 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 4034 . . . . . . 7  |-  ( y  =  B  ->  ( B  <  y  <->  B  <  B ) )
1716notbid 668 . . . . . 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 3642 . . . . 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 799 . . 3  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  -.  B  <  y )
232, 3, 5, 22supmaxti 7065 . 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 709    = wceq 1364    e. wcel 2164   {cpr 3620   class class class wbr 4030   supcsup 7043   RR*cxr 8055    < clt 8056    <_ cle 8057
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-pre-ltirr 7986  ax-pre-apti 7989
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-xp 4666  df-cnv 4668  df-iota 5216  df-riota 5874  df-sup 7045  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062
This theorem is referenced by:  xrmaxltsup  11404  xrmaxadd  11407  xrmineqinf  11415
  Copyright terms: Public domain W3C validator