MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  limcfval Structured version   Unicode version

Theorem limcfval 21350
Description: Value and set bounds on the limit operator. (Contributed by Mario Carneiro, 25-Dec-2016.)
Hypotheses
Ref Expression
limcval.j  |-  J  =  ( Kt  ( A  u.  { B } ) )
limcval.k  |-  K  =  ( TopOpen ` fld )
Assertion
Ref Expression
limcfval  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  (
( F lim CC  B
)  =  { y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) }  /\  ( F lim CC  B )  C_  CC ) )
Distinct variable groups:    y, z, A    y, B, z    y, F, z    y, K, z   
y, J
Allowed substitution hint:    J( z)

Proof of Theorem limcfval
Dummy variables  f 
j  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-limc 21344 . . . 4  |- lim CC  =  ( f  e.  ( CC  ^pm  CC ) ,  x  e.  CC  |->  { y  |  [. ( TopOpen ` fld )  /  j ]. ( z  e.  ( dom  f  u.  {
x } )  |->  if ( z  =  x ,  y ,  ( f `  z ) ) )  e.  ( ( ( jt  ( dom  f  u.  { x } ) )  CnP  j ) `  x
) } )
21a1i 11 . . 3  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  -> lim CC  =  ( f  e.  ( CC  ^pm  CC ) ,  x  e.  CC  |->  { y  |  [. ( TopOpen ` fld )  /  j ]. ( z  e.  ( dom  f  u.  {
x } )  |->  if ( z  =  x ,  y ,  ( f `  z ) ) )  e.  ( ( ( jt  ( dom  f  u.  { x } ) )  CnP  j ) `  x
) } ) )
3 fvex 5704 . . . . . 6  |-  ( TopOpen ` fld )  e.  _V
43a1i 11 . . . . 5  |-  ( ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  -> 
( TopOpen ` fld )  e.  _V )
5 simplrl 759 . . . . . . . . . 10  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  f  =  F )
65dmeqd 5045 . . . . . . . . 9  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  dom  f  =  dom  F )
7 simpll1 1027 . . . . . . . . . 10  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  F : A
--> CC )
8 fdm 5566 . . . . . . . . . 10  |-  ( F : A --> CC  ->  dom 
F  =  A )
97, 8syl 16 . . . . . . . . 9  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  dom  F  =  A )
106, 9eqtrd 2475 . . . . . . . 8  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  dom  f  =  A )
11 simplrr 760 . . . . . . . . 9  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  x  =  B )
1211sneqd 3892 . . . . . . . 8  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  { x }  =  { B } )
1310, 12uneq12d 3514 . . . . . . 7  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( dom  f  u.  { x } )  =  ( A  u.  { B } ) )
1411eqeq2d 2454 . . . . . . . 8  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( z  =  x  <->  z  =  B ) )
155fveq1d 5696 . . . . . . . 8  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( f `  z )  =  ( F `  z ) )
1614, 15ifbieq2d 3817 . . . . . . 7  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  if (
z  =  x ,  y ,  ( f `
 z ) )  =  if ( z  =  B ,  y ,  ( F `  z ) ) )
1713, 16mpteq12dv 4373 . . . . . 6  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( z  e.  ( dom  f  u. 
{ x } ) 
|->  if ( z  =  x ,  y ,  ( f `  z
) ) )  =  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) ) )
18 simpr 461 . . . . . . . . . . 11  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  j  =  ( TopOpen ` fld ) )
19 limcval.k . . . . . . . . . . 11  |-  K  =  ( TopOpen ` fld )
2018, 19syl6eqr 2493 . . . . . . . . . 10  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  j  =  K )
2120, 13oveq12d 6112 . . . . . . . . 9  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( jt  ( dom  f  u.  { x } ) )  =  ( Kt  ( A  u.  { B } ) ) )
22 limcval.j . . . . . . . . 9  |-  J  =  ( Kt  ( A  u.  { B } ) )
2321, 22syl6eqr 2493 . . . . . . . 8  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( jt  ( dom  f  u.  { x } ) )  =  J )
2423, 20oveq12d 6112 . . . . . . 7  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( (
jt  ( dom  f  u. 
{ x } ) )  CnP  j )  =  ( J  CnP  K ) )
2524, 11fveq12d 5700 . . . . . 6  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( (
( jt  ( dom  f  u.  { x } ) )  CnP  j ) `
 x )  =  ( ( J  CnP  K ) `  B ) )
2617, 25eleq12d 2511 . . . . 5  |-  ( ( ( ( F : A
--> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  /\  j  =  ( TopOpen ` fld )
)  ->  ( (
z  e.  ( dom  f  u.  { x } )  |->  if ( z  =  x ,  y ,  ( f `
 z ) ) )  e.  ( ( ( jt  ( dom  f  u.  { x } ) )  CnP  j ) `
 x )  <->  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) ) )
274, 26sbcied 3226 . . . 4  |-  ( ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  -> 
( [. ( TopOpen ` fld )  /  j ]. ( z  e.  ( dom  f  u.  {
x } )  |->  if ( z  =  x ,  y ,  ( f `  z ) ) )  e.  ( ( ( jt  ( dom  f  u.  { x } ) )  CnP  j ) `  x
)  <->  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) ) )
2827abbidv 2560 . . 3  |-  ( ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  /\  ( f  =  F  /\  x  =  B ) )  ->  { y  |  [. ( TopOpen ` fld )  /  j ]. ( z  e.  ( dom  f  u.  {
x } )  |->  if ( z  =  x ,  y ,  ( f `  z ) ) )  e.  ( ( ( jt  ( dom  f  u.  { x } ) )  CnP  j ) `  x
) }  =  {
y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B ,  y ,  ( F `  z ) ) )  e.  ( ( J  CnP  K
) `  B ) } )
29 cnex 9366 . . . . 5  |-  CC  e.  _V
30 elpm2r 7233 . . . . 5  |-  ( ( ( CC  e.  _V  /\  CC  e.  _V )  /\  ( F : A --> CC  /\  A  C_  CC ) )  ->  F  e.  ( CC  ^pm  CC ) )
3129, 29, 30mpanl12 682 . . . 4  |-  ( ( F : A --> CC  /\  A  C_  CC )  ->  F  e.  ( CC  ^pm 
CC ) )
32313adant3 1008 . . 3  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  F  e.  ( CC  ^pm  CC ) )
33 simp3 990 . . 3  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  B  e.  CC )
34 eqid 2443 . . . . . 6  |-  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B ,  y ,  ( F `  z ) ) )  =  ( z  e.  ( A  u.  { B }
)  |->  if ( z  =  B ,  y ,  ( F `  z ) ) )
3522, 19, 34limcvallem 21349 . . . . 5  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  (
( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B )  -> 
y  e.  CC ) )
3635abssdv 3429 . . . 4  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  { y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) } 
C_  CC )
3729ssex 4439 . . . 4  |-  ( { y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B ,  y ,  ( F `  z ) ) )  e.  ( ( J  CnP  K
) `  B ) }  C_  CC  ->  { y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) }  e.  _V )
3836, 37syl 16 . . 3  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  { y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) }  e.  _V )
392, 28, 32, 33, 38ovmpt2d 6221 . 2  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  ( F lim CC  B )  =  { y  |  ( z  e.  ( A  u.  { B }
)  |->  if ( z  =  B ,  y ,  ( F `  z ) ) )  e.  ( ( J  CnP  K ) `  B ) } )
4039, 36eqsstrd 3393 . 2  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  ( F lim CC  B )  C_  CC )
4139, 40jca 532 1  |-  ( ( F : A --> CC  /\  A  C_  CC  /\  B  e.  CC )  ->  (
( F lim CC  B
)  =  { y  |  ( z  e.  ( A  u.  { B } )  |->  if ( z  =  B , 
y ,  ( F `
 z ) ) )  e.  ( ( J  CnP  K ) `
 B ) }  /\  ( F lim CC  B )  C_  CC ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 965    = wceq 1369    e. wcel 1756   {cab 2429   _Vcvv 2975   [.wsbc 3189    u. cun 3329    C_ wss 3331   ifcif 3794   {csn 3880    e. cmpt 4353   dom cdm 4843   -->wf 5417   ` cfv 5421  (class class class)co 6094    e. cmpt2 6096    ^pm cpm 7218   CCcc 9283   ↾t crest 14362   TopOpenctopn 14363  ℂfldccnfld 17821    CnP ccnp 18832   lim CC climc 21340
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4406  ax-sep 4416  ax-nul 4424  ax-pow 4473  ax-pr 4534  ax-un 6375  ax-cnex 9341  ax-resscn 9342  ax-1cn 9343  ax-icn 9344  ax-addcl 9345  ax-addrcl 9346  ax-mulcl 9347  ax-mulrcl 9348  ax-mulcom 9349  ax-addass 9350  ax-mulass 9351  ax-distr 9352  ax-i2m1 9353  ax-1ne0 9354  ax-1rid 9355  ax-rnegex 9356  ax-rrecex 9357  ax-cnre 9358  ax-pre-lttri 9359  ax-pre-lttrn 9360  ax-pre-ltadd 9361  ax-pre-mulgt0 9362  ax-pre-sup 9363
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2571  df-ne 2611  df-nel 2612  df-ral 2723  df-rex 2724  df-reu 2725  df-rmo 2726  df-rab 2727  df-v 2977  df-sbc 3190  df-csb 3292  df-dif 3334  df-un 3336  df-in 3338  df-ss 3345  df-pss 3347  df-nul 3641  df-if 3795  df-pw 3865  df-sn 3881  df-pr 3883  df-tp 3885  df-op 3887  df-uni 4095  df-int 4132  df-iun 4176  df-br 4296  df-opab 4354  df-mpt 4355  df-tr 4389  df-eprel 4635  df-id 4639  df-po 4644  df-so 4645  df-fr 4682  df-we 4684  df-ord 4725  df-on 4726  df-lim 4727  df-suc 4728  df-xp 4849  df-rel 4850  df-cnv 4851  df-co 4852  df-dm 4853  df-rn 4854  df-res 4855  df-ima 4856  df-iota 5384  df-fun 5423  df-fn 5424  df-f 5425  df-f1 5426  df-fo 5427  df-f1o 5428  df-fv 5429  df-riota 6055  df-ov 6097  df-oprab 6098  df-mpt2 6099  df-om 6480  df-1st 6580  df-2nd 6581  df-recs 6835  df-rdg 6869  df-1o 6923  df-oadd 6927  df-er 7104  df-map 7219  df-pm 7220  df-en 7314  df-dom 7315  df-sdom 7316  df-fin 7317  df-fi 7664  df-sup 7694  df-pnf 9423  df-mnf 9424  df-xr 9425  df-ltxr 9426  df-le 9427  df-sub 9600  df-neg 9601  df-div 9997  df-nn 10326  df-2 10383  df-3 10384  df-4 10385  df-5 10386  df-6 10387  df-7 10388  df-8 10389  df-9 10390  df-10 10391  df-n0 10583  df-z 10650  df-dec 10759  df-uz 10865  df-q 10957  df-rp 10995  df-xneg 11092  df-xadd 11093  df-xmul 11094  df-fz 11441  df-seq 11810  df-exp 11869  df-cj 12591  df-re 12592  df-im 12593  df-sqr 12727  df-abs 12728  df-struct 14179  df-ndx 14180  df-slot 14181  df-base 14182  df-plusg 14254  df-mulr 14255  df-starv 14256  df-tset 14260  df-ple 14261  df-ds 14263  df-unif 14264  df-rest 14364  df-topn 14365  df-topgen 14385  df-psmet 17812  df-xmet 17813  df-met 17814  df-bl 17815  df-mopn 17816  df-cnfld 17822  df-top 18506  df-bases 18508  df-topon 18509  df-topsp 18510  df-cnp 18835  df-xms 19898  df-ms 19899  df-limc 21344
This theorem is referenced by:  ellimc  21351  limccl  21353
  Copyright terms: Public domain W3C validator