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

Theorem infxrnegsupex 11814
Description: The infimum of a set of extended reals  A is the negative of the supremum of the negatives of its elements. (Contributed by Jim Kingdon, 2-May-2023.)
Hypotheses
Ref Expression
infxrnegsupex.ex  |-  ( ph  ->  E. x  e.  RR*  ( A. y  e.  A  -.  y  <  x  /\  A. y  e.  RR*  (
x  <  y  ->  E. z  e.  A  z  <  y ) ) )
infxrnegsupex.ss  |-  ( ph  ->  A  C_  RR* )
Assertion
Ref Expression
infxrnegsupex  |-  ( ph  -> inf ( A ,  RR* ,  <  )  =  -e sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )
)
Distinct variable groups:    x, A, y, z    ph, x, y, z

Proof of Theorem infxrnegsupex
Dummy variables  f  g  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xrlttri3 10022 . . . . 5  |-  ( ( f  e.  RR*  /\  g  e.  RR* )  ->  (
f  =  g  <->  ( -.  f  <  g  /\  -.  g  <  f ) ) )
21adantl 277 . . . 4  |-  ( (
ph  /\  ( f  e.  RR*  /\  g  e. 
RR* ) )  -> 
( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
3 infxrnegsupex.ex . . . 4  |-  ( ph  ->  E. x  e.  RR*  ( A. y  e.  A  -.  y  <  x  /\  A. y  e.  RR*  (
x  <  y  ->  E. z  e.  A  z  <  y ) ) )
42, 3infclti 7213 . . 3  |-  ( ph  -> inf ( A ,  RR* ,  <  )  e.  RR* )
5 xnegneg 10058 . . 3  |-  (inf ( A ,  RR* ,  <  )  e.  RR*  ->  -e  -einf ( A ,  RR* ,  <  )  = inf ( A ,  RR* ,  <  ) )
64, 5syl 14 . 2  |-  ( ph  -> 
-e  -einf ( A ,  RR* ,  <  )  = inf ( A ,  RR* ,  <  ) )
7 xnegeq 10052 . . . . . . . . 9  |-  ( w  =  z  ->  -e
w  =  -e
z )
87cbvmptv 4183 . . . . . . . 8  |-  ( w  e.  RR*  |->  -e
w )  =  ( z  e.  RR*  |->  -e
z )
98mptpreima 5228 . . . . . . 7  |-  ( `' ( w  e.  RR*  |->  -e w ) " A )  =  {
z  e.  RR*  |  -e z  e.  A }
10 eqid 2229 . . . . . . . . . 10  |-  ( w  e.  RR*  |->  -e
w )  =  ( w  e.  RR*  |->  -e
w )
1110xrnegiso 11813 . . . . . . . . 9  |-  ( ( w  e.  RR*  |->  -e
w )  Isom  <  ,  `'  <  ( RR* ,  RR* )  /\  `' ( w  e.  RR*  |->  -e
w )  =  ( w  e.  RR*  |->  -e
w ) )
1211simpri 113 . . . . . . . 8  |-  `' ( w  e.  RR*  |->  -e
w )  =  ( w  e.  RR*  |->  -e
w )
1312imaeq1i 5071 . . . . . . 7  |-  ( `' ( w  e.  RR*  |->  -e w ) " A )  =  ( ( w  e.  RR*  |->  -e w ) " A )
149, 13eqtr3i 2252 . . . . . 6  |-  { z  e.  RR*  |  -e
z  e.  A }  =  ( ( w  e.  RR*  |->  -e
w ) " A
)
1514supeq1i 7178 . . . . 5  |-  sup ( { z  e.  RR*  | 
-e z  e.  A } ,  RR* ,  <  )  =  sup ( ( ( w  e.  RR*  |->  -e
w ) " A
) ,  RR* ,  <  )
1611simpli 111 . . . . . . . . 9  |-  ( w  e.  RR*  |->  -e
w )  Isom  <  ,  `'  <  ( RR* ,  RR* )
17 isocnv 5947 . . . . . . . . 9  |-  ( ( w  e.  RR*  |->  -e
w )  Isom  <  ,  `'  <  ( RR* ,  RR* )  ->  `' ( w  e.  RR*  |->  -e
w )  Isom  `'  <  ,  <  ( RR* ,  RR* ) )
1816, 17ax-mp 5 . . . . . . . 8  |-  `' ( w  e.  RR*  |->  -e
w )  Isom  `'  <  ,  <  ( RR* ,  RR* )
19 isoeq1 5937 . . . . . . . . 9  |-  ( `' ( w  e.  RR*  |->  -e w )  =  ( w  e.  RR*  |->  -e w )  -> 
( `' ( w  e.  RR*  |->  -e
w )  Isom  `'  <  ,  <  ( RR* ,  RR* ) 
<->  ( w  e.  RR*  |->  -e w )  Isom  `'  <  ,  <  ( RR* ,  RR* ) ) )
2012, 19ax-mp 5 . . . . . . . 8  |-  ( `' ( w  e.  RR*  |->  -e w )  Isom  `'  <  ,  <  ( RR* ,  RR* )  <->  ( w  e.  RR*  |->  -e w ) 
Isom  `'  <  ,  <  (
RR* ,  RR* ) )
2118, 20mpbi 145 . . . . . . 7  |-  ( w  e.  RR*  |->  -e
w )  Isom  `'  <  ,  <  ( RR* ,  RR* )
2221a1i 9 . . . . . 6  |-  ( ph  ->  ( w  e.  RR*  |->  -e w )  Isom  `'  <  ,  <  ( RR* ,  RR* ) )
23 infxrnegsupex.ss . . . . . 6  |-  ( ph  ->  A  C_  RR* )
243cnvinfex 7208 . . . . . 6  |-  ( ph  ->  E. x  e.  RR*  ( A. y  e.  A  -.  x `'  <  y  /\  A. y  e.  RR*  ( y `'  <  x  ->  E. z  e.  A  y `'  <  z ) ) )
252cnvti 7209 . . . . . 6  |-  ( (
ph  /\  ( f  e.  RR*  /\  g  e. 
RR* ) )  -> 
( f  =  g  <-> 
( -.  f `'  <  g  /\  -.  g `'  <  f ) ) )
2622, 23, 24, 25supisoti 7200 . . . . 5  |-  ( ph  ->  sup ( ( ( w  e.  RR*  |->  -e
w ) " A
) ,  RR* ,  <  )  =  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) ) )
2715, 26eqtrid 2274 . . . 4  |-  ( ph  ->  sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )  =  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) ) )
28 df-inf 7175 . . . . . . 7  |- inf ( A ,  RR* ,  <  )  =  sup ( A ,  RR* ,  `'  <  )
2928eqcomi 2233 . . . . . 6  |-  sup ( A ,  RR* ,  `'  <  )  = inf ( A ,  RR* ,  <  )
3029fveq2i 5638 . . . . 5  |-  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) )  =  ( ( w  e.  RR*  |->  -e w ) ` inf ( A ,  RR* ,  <  ) )
31 eqidd 2230 . . . . . 6  |-  ( ph  ->  ( w  e.  RR*  |->  -e w )  =  ( w  e.  RR*  |->  -e w ) )
32 xnegeq 10052 . . . . . . 7  |-  ( w  = inf ( A ,  RR* ,  <  )  ->  -e w  =  -einf ( A ,  RR* ,  <  ) )
3332adantl 277 . . . . . 6  |-  ( (
ph  /\  w  = inf ( A ,  RR* ,  <  ) )  ->  -e w  =  -einf ( A ,  RR* ,  <  ) )
344xnegcld 10080 . . . . . 6  |-  ( ph  -> 
-einf ( A ,  RR* ,  <  )  e.  RR* )
3531, 33, 4, 34fvmptd 5723 . . . . 5  |-  ( ph  ->  ( ( w  e. 
RR*  |->  -e w ) `
inf ( A ,  RR* ,  <  ) )  =  -einf ( A ,  RR* ,  <  ) )
3630, 35eqtrid 2274 . . . 4  |-  ( ph  ->  ( ( w  e. 
RR*  |->  -e w ) `
 sup ( A ,  RR* ,  `'  <  ) )  =  -einf ( A ,  RR* ,  <  ) )
3727, 36eqtr2d 2263 . . 3  |-  ( ph  -> 
-einf ( A ,  RR* ,  <  )  =  sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )
)
38 xnegeq 10052 . . 3  |-  (  -einf ( A ,  RR* ,  <  )  =  sup ( { z  e.  RR*  | 
-e z  e.  A } ,  RR* ,  <  )  ->  -e  -einf ( A ,  RR* ,  <  )  = 
-e sup ( { z  e.  RR*  | 
-e z  e.  A } ,  RR* ,  <  ) )
3937, 38syl 14 . 2  |-  ( ph  -> 
-e  -einf ( A ,  RR* ,  <  )  =  -e sup ( { z  e. 
RR*  |  -e z  e.  A } ,  RR* ,  <  ) )
406, 39eqtr3d 2264 1  |-  ( ph  -> inf ( A ,  RR* ,  <  )  =  -e sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   {crab 2512    C_ wss 3198   class class class wbr 4086    |-> cmpt 4148   `'ccnv 4722   "cima 4726   ` cfv 5324    Isom wiso 5325   supcsup 7172  infcinf 7173   RR*cxr 8203    < clt 8204    -ecxne 9994
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-apti 8137  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-isom 5333  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-sup 7174  df-inf 7175  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-sub 8342  df-neg 8343  df-xneg 9997
This theorem is referenced by:  xrminmax  11816
  Copyright terms: Public domain W3C validator