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

Theorem maxleim 11180
Description: Value of maximum when we know which number is larger. (Contributed by Jim Kingdon, 21-Dec-2021.)
Assertion
Ref Expression
maxleim  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <_  B  ->  sup ( { A ,  B } ,  RR ,  <  )  =  B ) )

Proof of Theorem maxleim
Dummy variables  f  g  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lttri3 8011 . . . 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 3694 . . . 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 simpll 527 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B
)  ->  A  e.  RR )
76ad2antrr 488 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  A  e.  RR )
83ad2antrr 488 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  B  e.  RR )
9 simpllr 534 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  A  <_  B )
107, 8, 9lensymd 8053 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  A )
11 breq2 4002 . . . . . . 7  |-  ( y  =  A  ->  ( B  <  y  <->  B  <  A ) )
1211notbid 667 . . . . . 6  |-  ( y  =  A  ->  ( -.  B  <  y  <->  -.  B  <  A ) )
1312adantl 277 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  ( -.  B  <  y  <->  -.  B  <  A ) )
1410, 13mpbird 167 . . . 4  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  y )
153ad2antrr 488 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  B  e.  RR )
1615ltnrd 8043 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  B )
17 breq2 4002 . . . . . . 7  |-  ( y  =  B  ->  ( B  <  y  <->  B  <  B ) )
1817notbid 667 . . . . . 6  |-  ( y  =  B  ->  ( -.  B  <  y  <->  -.  B  <  B ) )
1918adantl 277 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  ( -.  B  <  y  <->  -.  B  <  B ) )
2016, 19mpbird 167 . . . 4  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  y )
21 elpri 3612 . . . . 5  |-  ( y  e.  { A ,  B }  ->  ( y  =  A  \/  y  =  B ) )
2221adantl 277 . . . 4  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  (
y  =  A  \/  y  =  B )
)
2314, 20, 22mpjaodan 798 . . 3  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  -.  B  <  y )
242, 3, 5, 23supmaxti 6993 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B
)  ->  sup ( { A ,  B } ,  RR ,  <  )  =  B )
2524ex 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 708    = wceq 1353    e. wcel 2146   {cpr 3590   class class class wbr 3998   supcsup 6971   RRcr 7785    < clt 7966    <_ cle 7967
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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-pre-ltirr 7898  ax-pre-apti 7901
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-br 3999  df-opab 4060  df-xp 4626  df-cnv 4628  df-iota 5170  df-riota 5821  df-sup 6973  df-pnf 7968  df-mnf 7969  df-xr 7970  df-ltxr 7971  df-le 7972
This theorem is referenced by:  maxleb  11191  xrmaxiflemab  11221
  Copyright terms: Public domain W3C validator