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

Theorem climcncf 15258
Description: Image of a limit under a continuous map. (Contributed by Mario Carneiro, 7-Apr-2015.)
Hypotheses
Ref Expression
climcncf.1  |-  Z  =  ( ZZ>= `  M )
climcncf.2  |-  ( ph  ->  M  e.  ZZ )
climcncf.4  |-  ( ph  ->  F  e.  ( A
-cn-> B ) )
climcncf.5  |-  ( ph  ->  G : Z --> A )
climcncf.6  |-  ( ph  ->  G  ~~>  D )
climcncf.7  |-  ( ph  ->  D  e.  A )
Assertion
Ref Expression
climcncf  |-  ( ph  ->  ( F  o.  G
)  ~~>  ( F `  D ) )

Proof of Theorem climcncf
Dummy variables  y  z  x  k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 climcncf.1 . 2  |-  Z  =  ( ZZ>= `  M )
2 climcncf.2 . 2  |-  ( ph  ->  M  e.  ZZ )
3 climcncf.7 . 2  |-  ( ph  ->  D  e.  A )
4 climcncf.4 . . . . 5  |-  ( ph  ->  F  e.  ( A
-cn-> B ) )
5 cncff 15251 . . . . 5  |-  ( F  e.  ( A -cn-> B )  ->  F : A
--> B )
64, 5syl 14 . . . 4  |-  ( ph  ->  F : A --> B )
76ffvelcdmda 5770 . . 3  |-  ( (
ph  /\  z  e.  A )  ->  ( F `  z )  e.  B )
8 cncfrss2 15250 . . . . 5  |-  ( F  e.  ( A -cn-> B )  ->  B  C_  CC )
94, 8syl 14 . . . 4  |-  ( ph  ->  B  C_  CC )
109sselda 3224 . . 3  |-  ( (
ph  /\  ( F `  z )  e.  B
)  ->  ( F `  z )  e.  CC )
117, 10syldan 282 . 2  |-  ( (
ph  /\  z  e.  A )  ->  ( F `  z )  e.  CC )
12 climcncf.6 . 2  |-  ( ph  ->  G  ~~>  D )
13 climcncf.5 . . . 4  |-  ( ph  ->  G : Z --> A )
14 zex 9455 . . . . . 6  |-  ZZ  e.  _V
15 uzssz 9742 . . . . . 6  |-  ( ZZ>= `  M )  C_  ZZ
1614, 15ssexi 4222 . . . . 5  |-  ( ZZ>= `  M )  e.  _V
171, 16eqeltri 2302 . . . 4  |-  Z  e. 
_V
18 fex 5868 . . . 4  |-  ( ( G : Z --> A  /\  Z  e.  _V )  ->  G  e.  _V )
1913, 17, 18sylancl 413 . . 3  |-  ( ph  ->  G  e.  _V )
20 coexg 5273 . . 3  |-  ( ( F  e.  ( A
-cn-> B )  /\  G  e.  _V )  ->  ( F  o.  G )  e.  _V )
214, 19, 20syl2anc 411 . 2  |-  ( ph  ->  ( F  o.  G
)  e.  _V )
22 cncfi 15252 . . . . 5  |-  ( ( F  e.  ( A
-cn-> B )  /\  D  e.  A  /\  x  e.  RR+ )  ->  E. y  e.  RR+  A. z  e.  A  ( ( abs `  ( z  -  D
) )  <  y  ->  ( abs `  (
( F `  z
)  -  ( F `
 D ) ) )  <  x ) )
23223expia 1229 . . . 4  |-  ( ( F  e.  ( A
-cn-> B )  /\  D  e.  A )  ->  (
x  e.  RR+  ->  E. y  e.  RR+  A. z  e.  A  ( ( abs `  ( z  -  D ) )  < 
y  ->  ( abs `  ( ( F `  z )  -  ( F `  D )
) )  <  x
) ) )
244, 3, 23syl2anc 411 . . 3  |-  ( ph  ->  ( x  e.  RR+  ->  E. y  e.  RR+  A. z  e.  A  ( ( abs `  (
z  -  D ) )  <  y  -> 
( abs `  (
( F `  z
)  -  ( F `
 D ) ) )  <  x ) ) )
2524imp 124 . 2  |-  ( (
ph  /\  x  e.  RR+ )  ->  E. y  e.  RR+  A. z  e.  A  ( ( abs `  ( z  -  D
) )  <  y  ->  ( abs `  (
( F `  z
)  -  ( F `
 D ) ) )  <  x ) )
2613ffvelcdmda 5770 . 2  |-  ( (
ph  /\  k  e.  Z )  ->  ( G `  k )  e.  A )
27 fvco3 5705 . . 3  |-  ( ( G : Z --> A  /\  k  e.  Z )  ->  ( ( F  o.  G ) `  k
)  =  ( F `
 ( G `  k ) ) )
2813, 27sylan 283 . 2  |-  ( (
ph  /\  k  e.  Z )  ->  (
( F  o.  G
) `  k )  =  ( F `  ( G `  k ) ) )
291, 2, 3, 11, 12, 21, 25, 26, 28climcn1 11819 1  |-  ( ph  ->  ( F  o.  G
)  ~~>  ( F `  D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   _Vcvv 2799    C_ wss 3197   class class class wbr 4083    o. ccom 4723   -->wf 5314   ` cfv 5318  (class class class)co 6001   CCcc 7997    < clt 8181    - cmin 8317   ZZcz 9446   ZZ>=cuz 9722   RR+crp 9849   abscabs 11508    ~~> cli 11789   -cn->ccncf 15244
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-coll 4199  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-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117
This theorem depends on definitions:  df-bi 117  df-dc 840  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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-po 4387  df-iso 4388  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-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-map 6797  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-2 9169  df-n0 9370  df-z 9447  df-uz 9723  df-cj 11353  df-re 11354  df-im 11355  df-rsqrt 11509  df-abs 11510  df-clim 11790  df-cncf 15245
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator