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

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

Proof of Theorem infrenegsupex
Dummy variables  f  g  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lttri3 8226 . . . . . 6  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
21adantl 277 . . . . 5  |-  ( (
ph  /\  ( f  e.  RR  /\  g  e.  RR ) )  -> 
( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
3 infrenegsupex.ex . . . . 5  |-  ( 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 7190 . . . 4  |-  ( ph  -> inf ( A ,  RR ,  <  )  e.  RR )
54recnd 8175 . . 3  |-  ( ph  -> inf ( A ,  RR ,  <  )  e.  CC )
65negnegd 8448 . 2  |-  ( ph  -> 
-u -uinf ( A ,  RR ,  <  )  = inf ( A ,  RR ,  <  ) )
7 negeq 8339 . . . . . . . . 9  |-  ( w  =  z  ->  -u w  =  -u z )
87cbvmptv 4180 . . . . . . . 8  |-  ( w  e.  RR  |->  -u w
)  =  ( z  e.  RR  |->  -u z
)
98mptpreima 5222 . . . . . . 7  |-  ( `' ( w  e.  RR  |->  -u w ) " A
)  =  { z  e.  RR  |  -u z  e.  A }
10 eqid 2229 . . . . . . . . . 10  |-  ( w  e.  RR  |->  -u w
)  =  ( w  e.  RR  |->  -u w
)
1110negiso 9102 . . . . . . . . 9  |-  ( ( w  e.  RR  |->  -u w )  Isom  <  ,  `'  <  ( RR ,  RR )  /\  `' ( w  e.  RR  |->  -u w )  =  ( w  e.  RR  |->  -u w ) )
1211simpri 113 . . . . . . . 8  |-  `' ( w  e.  RR  |->  -u w )  =  ( w  e.  RR  |->  -u w )
1312imaeq1i 5065 . . . . . . 7  |-  ( `' ( w  e.  RR  |->  -u w ) " A
)  =  ( ( w  e.  RR  |->  -u w ) " A
)
149, 13eqtr3i 2252 . . . . . 6  |-  { z  e.  RR  |  -u z  e.  A }  =  ( ( w  e.  RR  |->  -u w
) " A )
1514supeq1i 7155 . . . . 5  |-  sup ( { z  e.  RR  |  -u z  e.  A } ,  RR ,  <  )  =  sup (
( ( w  e.  RR  |->  -u w ) " A ) ,  RR ,  <  )
1611simpli 111 . . . . . . . . 9  |-  ( w  e.  RR  |->  -u w
)  Isom  <  ,  `'  <  ( RR ,  RR )
17 isocnv 5935 . . . . . . . . 9  |-  ( ( w  e.  RR  |->  -u w )  Isom  <  ,  `'  <  ( RR ,  RR )  ->  `' ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR ) )
1816, 17ax-mp 5 . . . . . . . 8  |-  `' ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR )
19 isoeq1 5925 . . . . . . . . 9  |-  ( `' ( w  e.  RR  |->  -u w )  =  ( w  e.  RR  |->  -u w )  ->  ( `' ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR )  <->  ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR ) ) )
2012, 19ax-mp 5 . . . . . . . 8  |-  ( `' ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR )  <->  ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR )
)
2118, 20mpbi 145 . . . . . . 7  |-  ( w  e.  RR  |->  -u w
)  Isom  `'  <  ,  <  ( RR ,  RR )
2221a1i 9 . . . . . 6  |-  ( ph  ->  ( w  e.  RR  |->  -u w )  Isom  `'  <  ,  <  ( RR ,  RR ) )
23 infrenegsupex.ss . . . . . 6  |-  ( ph  ->  A  C_  RR )
243cnvinfex 7185 . . . . . 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 7186 . . . . . 6  |-  ( (
ph  /\  ( f  e.  RR  /\  g  e.  RR ) )  -> 
( f  =  g  <-> 
( -.  f `'  <  g  /\  -.  g `'  <  f ) ) )
2622, 23, 24, 25supisoti 7177 . . . . 5  |-  ( ph  ->  sup ( ( ( w  e.  RR  |->  -u w ) " A
) ,  RR ,  <  )  =  ( ( w  e.  RR  |->  -u w ) `  sup ( A ,  RR ,  `'  <  ) ) )
2715, 26eqtrid 2274 . . . 4  |-  ( ph  ->  sup ( { z  e.  RR  |  -u z  e.  A } ,  RR ,  <  )  =  ( ( w  e.  RR  |->  -u w
) `  sup ( A ,  RR ,  `'  <  ) ) )
28 df-inf 7152 . . . . . . 7  |- inf ( A ,  RR ,  <  )  =  sup ( A ,  RR ,  `'  <  )
2928eqcomi 2233 . . . . . 6  |-  sup ( A ,  RR ,  `'  <  )  = inf ( A ,  RR ,  <  )
3029fveq2i 5630 . . . . 5  |-  ( ( w  e.  RR  |->  -u w ) `  sup ( A ,  RR ,  `'  <  ) )  =  ( ( w  e.  RR  |->  -u w ) ` inf ( A ,  RR ,  <  ) )
31 eqidd 2230 . . . . . 6  |-  ( ph  ->  ( w  e.  RR  |->  -u w )  =  ( w  e.  RR  |->  -u w ) )
32 negeq 8339 . . . . . . 7  |-  ( w  = inf ( A ,  RR ,  <  )  ->  -u w  =  -uinf ( A ,  RR ,  <  ) )
3332adantl 277 . . . . . 6  |-  ( (
ph  /\  w  = inf ( A ,  RR ,  <  ) )  ->  -u w  =  -uinf ( A ,  RR ,  <  ) )
345negcld 8444 . . . . . 6  |-  ( ph  -> 
-uinf ( A ,  RR ,  <  )  e.  CC )
3531, 33, 4, 34fvmptd 5715 . . . . 5  |-  ( ph  ->  ( ( w  e.  RR  |->  -u w ) ` inf ( A ,  RR ,  <  ) )  =  -uinf ( A ,  RR ,  <  ) )
3630, 35eqtrid 2274 . . . 4  |-  ( ph  ->  ( ( w  e.  RR  |->  -u w ) `  sup ( A ,  RR ,  `'  <  ) )  =  -uinf ( A ,  RR ,  <  ) )
3727, 36eqtr2d 2263 . . 3  |-  ( ph  -> 
-uinf ( A ,  RR ,  <  )  =  sup ( { z  e.  RR  |  -u z  e.  A } ,  RR ,  <  )
)
3837negeqd 8341 . 2  |-  ( ph  -> 
-u -uinf ( A ,  RR ,  <  )  = 
-u sup ( { z  e.  RR  |  -u z  e.  A } ,  RR ,  <  )
)
396, 38eqtr3d 2264 1  |-  ( ph  -> inf ( A ,  RR ,  <  )  =  -u sup ( { z  e.  RR  |  -u 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 3197   class class class wbr 4083    |-> cmpt 4145   `'ccnv 4718   "cima 4722   ` cfv 5318    Isom wiso 5319   supcsup 7149  infcinf 7150   CCcc 7997   RRcr 7998    < clt 8181   -ucneg 8318
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 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-apti 8114  ax-pre-ltadd 8115
This theorem depends on definitions:  df-bi 117  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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-isom 5327  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-sup 7151  df-inf 7152  df-pnf 8183  df-mnf 8184  df-ltxr 8186  df-sub 8319  df-neg 8320
This theorem is referenced by:  supminfex  9792  infssuzcldc  10455  minmax  11741
  Copyright terms: Public domain W3C validator