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

Theorem infxrnegsupex 11409
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 9866 . . . . 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 7084 . . 3  |-  ( ph  -> inf ( A ,  RR* ,  <  )  e.  RR* )
5 xnegneg 9902 . . 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 9896 . . . . . . . . 9  |-  ( w  =  z  ->  -e
w  =  -e
z )
87cbvmptv 4126 . . . . . . . 8  |-  ( w  e.  RR*  |->  -e
w )  =  ( z  e.  RR*  |->  -e
z )
98mptpreima 5160 . . . . . . 7  |-  ( `' ( w  e.  RR*  |->  -e w ) " A )  =  {
z  e.  RR*  |  -e z  e.  A }
10 eqid 2193 . . . . . . . . . 10  |-  ( w  e.  RR*  |->  -e
w )  =  ( w  e.  RR*  |->  -e
w )
1110xrnegiso 11408 . . . . . . . . 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 5003 . . . . . . 7  |-  ( `' ( w  e.  RR*  |->  -e w ) " A )  =  ( ( w  e.  RR*  |->  -e w ) " A )
149, 13eqtr3i 2216 . . . . . 6  |-  { z  e.  RR*  |  -e
z  e.  A }  =  ( ( w  e.  RR*  |->  -e
w ) " A
)
1514supeq1i 7049 . . . . 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 5855 . . . . . . . . 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 5845 . . . . . . . . 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 7079 . . . . . 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 7080 . . . . . 6  |-  ( (
ph  /\  ( f  e.  RR*  /\  g  e. 
RR* ) )  -> 
( f  =  g  <-> 
( -.  f `'  <  g  /\  -.  g `'  <  f ) ) )
2622, 23, 24, 25supisoti 7071 . . . . 5  |-  ( ph  ->  sup ( ( ( w  e.  RR*  |->  -e
w ) " A
) ,  RR* ,  <  )  =  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) ) )
2715, 26eqtrid 2238 . . . 4  |-  ( ph  ->  sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )  =  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) ) )
28 df-inf 7046 . . . . . . 7  |- inf ( A ,  RR* ,  <  )  =  sup ( A ,  RR* ,  `'  <  )
2928eqcomi 2197 . . . . . 6  |-  sup ( A ,  RR* ,  `'  <  )  = inf ( A ,  RR* ,  <  )
3029fveq2i 5558 . . . . 5  |-  ( ( w  e.  RR*  |->  -e
w ) `  sup ( A ,  RR* ,  `'  <  ) )  =  ( ( w  e.  RR*  |->  -e w ) ` inf ( A ,  RR* ,  <  ) )
31 eqidd 2194 . . . . . 6  |-  ( ph  ->  ( w  e.  RR*  |->  -e w )  =  ( w  e.  RR*  |->  -e w ) )
32 xnegeq 9896 . . . . . . 7  |-  ( w  = inf ( A ,  RR* ,  <  )  ->  -e w  =  -einf ( A ,  RR* ,  <  ) )
3332adantl 277 . . . . . 6  |-  ( (
ph  /\  w  = inf ( A ,  RR* ,  <  ) )  ->  -e w  =  -einf ( A ,  RR* ,  <  ) )
344xnegcld 9924 . . . . . 6  |-  ( ph  -> 
-einf ( A ,  RR* ,  <  )  e.  RR* )
3531, 33, 4, 34fvmptd 5639 . . . . 5  |-  ( ph  ->  ( ( w  e. 
RR*  |->  -e w ) `
inf ( A ,  RR* ,  <  ) )  =  -einf ( A ,  RR* ,  <  ) )
3630, 35eqtrid 2238 . . . 4  |-  ( ph  ->  ( ( w  e. 
RR*  |->  -e w ) `
 sup ( A ,  RR* ,  `'  <  ) )  =  -einf ( A ,  RR* ,  <  ) )
3727, 36eqtr2d 2227 . . 3  |-  ( ph  -> 
-einf ( A ,  RR* ,  <  )  =  sup ( { z  e.  RR*  |  -e
z  e.  A } ,  RR* ,  <  )
)
38 xnegeq 9896 . . 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 2228 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 1364    e. wcel 2164   A.wral 2472   E.wrex 2473   {crab 2476    C_ wss 3154   class class class wbr 4030    |-> cmpt 4091   `'ccnv 4659   "cima 4663   ` cfv 5255    Isom wiso 5256   supcsup 7043  infcinf 7044   RR*cxr 8055    < clt 8056    -ecxne 9838
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-apti 7989  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-isom 5264  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-sup 7045  df-inf 7046  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-sub 8194  df-neg 8195  df-xneg 9841
This theorem is referenced by:  xrminmax  11411
  Copyright terms: Public domain W3C validator