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

Theorem maxleim 11765
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 8258 . . . 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 529 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B
)  ->  B  e.  RR )
4 prid2g 3776 . . . 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 536 . . . . . 6  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  A  <_  B )
107, 8, 9lensymd 8300 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  A )  ->  -.  B  <  A )
11 breq2 4092 . . . . . . 7  |-  ( y  =  A  ->  ( B  <  y  <->  B  <  A ) )
1211notbid 673 . . . . . 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 8290 . . . . 5  |-  ( ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  /\  y  =  B )  ->  -.  B  <  B )
17 breq2 4092 . . . . . . 7  |-  ( y  =  B  ->  ( B  <  y  <->  B  <  B ) )
1817notbid 673 . . . . . 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 3692 . . . . 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 805 . . 3  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A  <_  B )  /\  y  e.  { A ,  B } )  ->  -.  B  <  y )
242, 3, 5, 23supmaxti 7202 . 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 715    = wceq 1397    e. wcel 2202   {cpr 3670   class class class wbr 4088   supcsup 7180   RRcr 8030    < clt 8213    <_ cle 8214
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-pre-ltirr 8143  ax-pre-apti 8146
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-cnv 4733  df-iota 5286  df-riota 5970  df-sup 7182  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219
This theorem is referenced by:  maxleb  11776  xrmaxiflemab  11807
  Copyright terms: Public domain W3C validator