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

Theorem xrmaxiflemval 11191
Description: Lemma for xrmaxif 11192. Value of the supremum. (Contributed by Jim Kingdon, 29-Apr-2023.)
Hypothesis
Ref Expression
xrmaxiflemval.m  |-  M  =  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) )
Assertion
Ref Expression
xrmaxiflemval  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( M  e.  RR*  /\  A. x  e.  { A ,  B }  -.  M  <  x  /\  A. x  e.  RR*  ( x  < 
M  ->  E. z  e.  { A ,  B } x  <  z ) ) )
Distinct variable groups:    x, A, z   
x, B, z
Allowed substitution hints:    M( x, z)

Proof of Theorem xrmaxiflemval
StepHypRef Expression
1 xrmaxiflemval.m . . 3  |-  M  =  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) )
2 xrmaxiflemcl 11186 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) )  e.  RR* )
31, 2eqeltrid 2253 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  M  e.  RR* )
4 vex 2729 . . . . 5  |-  x  e. 
_V
54elpr 3597 . . . 4  |-  ( x  e.  { A ,  B }  <->  ( x  =  A  \/  x  =  B ) )
6 xrmaxifle 11187 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A  <_  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) ) )
76, 1breqtrrdi 4024 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A  <_  M )
8 xrlenlt 7963 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  M  e.  RR* )  ->  ( A  <_  M  <->  -.  M  <  A ) )
93, 8syldan 280 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A  <_  M  <->  -.  M  <  A ) )
107, 9mpbid 146 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  -.  M  <  A )
11 breq2 3986 . . . . . . 7  |-  ( x  =  A  ->  ( M  <  x  <->  M  <  A ) )
1211notbid 657 . . . . . 6  |-  ( x  =  A  ->  ( -.  M  <  x  <->  -.  M  <  A ) )
1310, 12syl5ibrcom 156 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
x  =  A  ->  -.  M  <  x ) )
14 xrmaxifle 11187 . . . . . . . . 9  |-  ( ( B  e.  RR*  /\  A  e.  RR* )  ->  B  <_  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  sup ( { B ,  A } ,  RR ,  <  ) ) ) ) ) )
1514ancoms 266 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  B  <_  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  sup ( { B ,  A } ,  RR ,  <  ) ) ) ) ) )
16 xrmaxiflemcom 11190 . . . . . . . . 9  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) )  =  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  sup ( { B ,  A } ,  RR ,  <  )
) ) ) ) )
171, 16syl5eq 2211 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  M  =  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  sup ( { B ,  A } ,  RR ,  <  ) ) ) ) ) )
1815, 17breqtrrd 4010 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  B  <_  M )
19 simpr 109 . . . . . . . 8  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  B  e.  RR* )
20 xrlenlt 7963 . . . . . . . 8  |-  ( ( B  e.  RR*  /\  M  e.  RR* )  ->  ( B  <_  M  <->  -.  M  <  B ) )
2119, 3, 20syl2anc 409 . . . . . . 7  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( B  <_  M  <->  -.  M  <  B ) )
2218, 21mpbid 146 . . . . . 6  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  -.  M  <  B )
23 breq2 3986 . . . . . . 7  |-  ( x  =  B  ->  ( M  <  x  <->  M  <  B ) )
2423notbid 657 . . . . . 6  |-  ( x  =  B  ->  ( -.  M  <  x  <->  -.  M  <  B ) )
2522, 24syl5ibrcom 156 . . . . 5  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
x  =  B  ->  -.  M  <  x ) )
2613, 25jaod 707 . . . 4  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
( x  =  A  \/  x  =  B )  ->  -.  M  <  x ) )
275, 26syl5bi 151 . . 3  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  (
x  e.  { A ,  B }  ->  -.  M  <  x ) )
2827ralrimiv 2538 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A. x  e.  { A ,  B }  -.  M  <  x
)
29 prid1g 3680 . . . . . . 7  |-  ( A  e.  RR*  ->  A  e. 
{ A ,  B } )
3029ad4antr 486 . . . . . 6  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  A )  ->  A  e.  { A ,  B } )
31 breq2 3986 . . . . . . 7  |-  ( z  =  A  ->  (
x  <  z  <->  x  <  A ) )
3231rspcev 2830 . . . . . 6  |-  ( ( A  e.  { A ,  B }  /\  x  <  A )  ->  E. z  e.  { A ,  B } x  <  z )
3330, 32sylancom 417 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  A )  ->  E. z  e.  { A ,  B } x  <  z )
34 prid2g 3681 . . . . . . 7  |-  ( B  e.  RR*  ->  B  e. 
{ A ,  B } )
3534ad4antlr 487 . . . . . 6  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  B )  ->  B  e.  { A ,  B } )
36 breq2 3986 . . . . . . 7  |-  ( z  =  B  ->  (
x  <  z  <->  x  <  B ) )
3736rspcev 2830 . . . . . 6  |-  ( ( B  e.  { A ,  B }  /\  x  <  B )  ->  E. z  e.  { A ,  B } x  <  z )
3835, 37sylancom 417 . . . . 5  |-  ( ( ( ( ( A  e.  RR*  /\  B  e. 
RR* )  /\  x  e.  RR* )  /\  x  <  M )  /\  x  <  B )  ->  E. z  e.  { A ,  B } x  <  z )
39 simplll 523 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  A  e.  RR* )
40 simpllr 524 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  B  e.  RR* )
41 simplr 520 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  x  e.  RR* )
421breq2i 3990 . . . . . . . 8  |-  ( x  <  M  <->  x  <  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) ) )
4342biimpi 119 . . . . . . 7  |-  ( x  <  M  ->  x  <  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) ) )
4443adantl 275 . . . . . 6  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  x  <  if ( B  = +oo , +oo ,  if ( B  = -oo ,  A ,  if ( A  = +oo , +oo ,  if ( A  = -oo ,  B ,  sup ( { A ,  B } ,  RR ,  <  ) ) ) ) ) )
4539, 40, 41, 44xrmaxiflemlub 11189 . . . . 5  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  (
x  <  A  \/  x  <  B ) )
4633, 38, 45mpjaodan 788 . . . 4  |-  ( ( ( ( A  e. 
RR*  /\  B  e.  RR* )  /\  x  e. 
RR* )  /\  x  <  M )  ->  E. z  e.  { A ,  B } x  <  z )
4746ex 114 . . 3  |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  x  e.  RR* )  ->  ( x  <  M  ->  E. z  e.  { A ,  B }
x  <  z )
)
4847ralrimiva 2539 . 2  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  A. x  e.  RR*  ( x  < 
M  ->  E. z  e.  { A ,  B } x  <  z ) )
493, 28, 483jca 1167 1  |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( M  e.  RR*  /\  A. x  e.  { A ,  B }  -.  M  <  x  /\  A. x  e.  RR*  ( x  < 
M  ->  E. z  e.  { A ,  B } x  <  z ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 698    /\ w3a 968    = wceq 1343    e. wcel 2136   A.wral 2444   E.wrex 2445   ifcif 3520   {cpr 3577   class class class wbr 3982   supcsup 6947   RRcr 7752   +oocpnf 7930   -oocmnf 7931   RR*cxr 7932    < clt 7933    <_ cle 7934
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871  ax-arch 7872  ax-caucvg 7873
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-sup 6949  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-2 8916  df-3 8917  df-4 8918  df-n0 9115  df-z 9192  df-uz 9467  df-rp 9590  df-seqfrec 10381  df-exp 10455  df-cj 10784  df-re 10785  df-im 10786  df-rsqrt 10940  df-abs 10941
This theorem is referenced by:  xrmaxif  11192
  Copyright terms: Public domain W3C validator