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

Theorem maxleim 10970
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 7837 . . . 4  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
21adantl 275 . . 3  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  (
f  e.  RR  /\  g  e.  RR )
)  ->  ( f  =  g  <->  ( -.  f  <  g  /\  -.  g  <  f ) ) )
3 simplr 519 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B
)  ->  B  e.  RR )
4 prid2g 3623 . . . 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 518 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B
)  ->  A  e.  RR )
76ad2antrr 479 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  A  e.  RR )
83ad2antrr 479 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  B  e.  RR )
9 simpllr 523 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  A  <_  B )
107, 8, 9lensymd 7877 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  A )
11 breq2 3928 . . . . . . 7  |-  ( y  =  A  ->  ( B  <  y  <->  B  <  A ) )
1211notbid 656 . . . . . 6  |-  ( y  =  A  ->  ( -.  B  <  y  <->  -.  B  <  A ) )
1312adantl 275 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  ( -.  B  <  y  <->  -.  B  <  A ) )
1410, 13mpbird 166 . . . 4  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  y )
153ad2antrr 479 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  B  e.  RR )
1615ltnrd 7868 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  B )
17 breq2 3928 . . . . . . 7  |-  ( y  =  B  ->  ( B  <  y  <->  B  <  B ) )
1817notbid 656 . . . . . 6  |-  ( y  =  B  ->  ( -.  B  <  y  <->  -.  B  <  B ) )
1918adantl 275 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  ( -.  B  <  y  <->  -.  B  <  B ) )
2016, 19mpbird 166 . . . 4  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  y )
21 elpri 3545 . . . . 5  |-  ( y  e.  { A ,  B }  ->  ( y  =  A  \/  y  =  B ) )
2221adantl 275 . . . 4  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  (
y  =  A  \/  y  =  B )
)
2314, 20, 22mpjaodan 787 . . 3  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  -.  B  <  y )
242, 3, 5, 23supmaxti 6884 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B
)  ->  sup ( { A ,  B } ,  RR ,  <  )  =  B )
2524ex 114 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 103    <-> wb 104    \/ wo 697    = wceq 1331    e. wcel 1480   {cpr 3523   class class class wbr 3924   supcsup 6862   RRcr 7612    < clt 7793    <_ cle 7794
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-pre-ltirr 7725  ax-pre-apti 7728
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rmo 2422  df-rab 2423  df-v 2683  df-sbc 2905  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-xp 4540  df-cnv 4542  df-iota 5083  df-riota 5723  df-sup 6864  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799
This theorem is referenced by:  maxleb  10981  xrmaxiflemab  11009
  Copyright terms: Public domain W3C validator