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

Theorem infxrnegsupex 12007
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 10178 . . . . 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 7353 . . 3  |-  ( ph  -> inf ( A ,  RR* ,  <  )  e.  RR* )
5 xnegneg 10214 . . 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 10208 . . . . . . . . 9  |-  ( w  =  z  ->  -e
w  =  -e
z )
87cbvmptv 4222 . . . . . . . 8  |-  ( w  e.  RR*  |->  -e
w )  =  ( z  e.  RR*  |->  -e
z )
98mptpreima 5276 . . . . . . 7  |-  ( `' ( w  e.  RR*  |->  -e w ) " A )  =  {
z  e.  RR*  |  -e z  e.  A }
10 eqid 2238 . . . . . . . . . 10  |-  ( w  e.  RR*  |->  -e
w )  =  ( w  e.  RR*  |->  -e
w )
1110xrnegiso 12006 . . . . . . . . 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 5118 . . . . . . 7  |-  ( `' ( w  e.  RR*  |->  -e w ) " A )  =  ( ( w  e.  RR*  |->  -e w ) " A )
149, 13eqtr3i 2261 . . . . . 6  |-  { z  e.  RR*  |  -e
z  e.  A }  =  ( ( w  e.  RR*  |->  -e
w ) " A
)
1514supeq1i 7318 . . . . 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 6007 . . . . . . . . 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 5997 . . . . . . . . 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 7348 . . . . . 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 7349 . . . . . 6  |-  ( (
ph  /\  ( f  e.  RR*  /\  g  e. 
RR* ) )  -> 
( f  =  g  <-> 
( -.  f `'  <  g  /\  -.  g `'  <  f ) ) )
2622, 23, 24, 25supisoti 7340 . . . . 5  |-  ( ph  ->  sup ( ( ( w  e.  RR*  |->  -e
w ) " A
) ,  RR* ,  <  )  =  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) ) )
2715, 26eqtrid 2283 . . . 4  |-  ( ph  ->  sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )  =  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) ) )
28 df-inf 7315 . . . . . . 7  |- inf ( A ,  RR* ,  <  )  =  sup ( A ,  RR* ,  `'  <  )
2928eqcomi 2242 . . . . . 6  |-  sup ( A ,  RR* ,  `'  <  )  = inf ( A ,  RR* ,  <  )
3029fveq2i 5693 . . . . 5  |-  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) )  =  ( ( w  e.  RR*  |->  -e w ) ` inf ( A ,  RR* ,  <  ) )
31 eqidd 2239 . . . . . 6  |-  ( ph  ->  ( w  e.  RR*  |->  -e w )  =  ( w  e.  RR*  |->  -e w ) )
32 xnegeq 10208 . . . . . . 7  |-  ( w  = inf ( A ,  RR* ,  <  )  ->  -e w  =  -einf ( A ,  RR* ,  <  ) )
3332adantl 277 . . . . . 6  |-  ( (
ph  /\  w  = inf ( A ,  RR* ,  <  ) )  ->  -e w  =  -einf ( A ,  RR* ,  <  ) )
344xnegcld 10236 . . . . . 6  |-  ( ph  -> 
-einf ( A ,  RR* ,  <  )  e.  RR* )
3531, 33, 4, 34fvmptd 5780 . . . . 5  |-  ( ph  ->  ( ( w  e. 
RR*  |->  -e w ) `
inf ( A ,  RR* ,  <  ) )  =  -einf ( A ,  RR* ,  <  ) )
3630, 35eqtrid 2283 . . . 4  |-  ( ph  ->  ( ( w  e. 
RR*  |->  -e w ) `
 sup ( A ,  RR* ,  `'  <  ) )  =  -einf ( A ,  RR* ,  <  ) )
3727, 36eqtr2d 2272 . . 3  |-  ( ph  -> 
-einf ( A ,  RR* ,  <  )  =  sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )
)
38 xnegeq 10208 . . 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 2273 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 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532    C_ wss 3220   class class class wbr 4125    |-> cmpt 4187   `'ccnv 4768   "cima 4772   ` cfv 5372    Isom wiso 5373   supcsup 7312  infcinf 7313   RR*cxr 8349    < clt 8350    -ecxne 10150
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-apti 8284  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-isom 5381  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-sup 7314  df-inf 7315  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-sub 8489  df-neg 8490  df-xneg 10153
This theorem is referenced by:  xrminmax  12009
  Copyright terms: Public domain W3C validator