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

Theorem ulmf 19761
Description: Closure of a uniform limit of functions. (Contributed by Mario Carneiro, 26-Feb-2015.)
Assertion
Ref Expression
ulmf  |-  ( F ( ~~> u `  S
) G  ->  E. n  e.  ZZ  F : (
ZZ>= `  n ) --> ( CC  ^m  S ) )
Distinct variable groups:    n, F    n, G    S, n

Proof of Theorem ulmf
Dummy variables  j 
k  x  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ulmscl 19758 . . . 4  |-  ( F ( ~~> u `  S
) G  ->  S  e.  _V )
2 ulmval 19759 . . . 4  |-  ( S  e.  _V  ->  ( F ( ~~> u `  S ) G  <->  E. n  e.  ZZ  ( F :
( ZZ>= `  n ) --> ( CC  ^m  S )  /\  G : S --> CC  /\  A. x  e.  RR+  E. j  e.  (
ZZ>= `  n ) A. k  e.  ( ZZ>= `  j ) A. z  e.  S  ( abs `  ( ( ( F `
 k ) `  z )  -  ( G `  z )
) )  <  x
) ) )
31, 2syl 15 . . 3  |-  ( F ( ~~> u `  S
) G  ->  ( F ( ~~> u `  S ) G  <->  E. n  e.  ZZ  ( F :
( ZZ>= `  n ) --> ( CC  ^m  S )  /\  G : S --> CC  /\  A. x  e.  RR+  E. j  e.  (
ZZ>= `  n ) A. k  e.  ( ZZ>= `  j ) A. z  e.  S  ( abs `  ( ( ( F `
 k ) `  z )  -  ( G `  z )
) )  <  x
) ) )
43ibi 232 . 2  |-  ( F ( ~~> u `  S
) G  ->  E. n  e.  ZZ  ( F :
( ZZ>= `  n ) --> ( CC  ^m  S )  /\  G : S --> CC  /\  A. x  e.  RR+  E. j  e.  (
ZZ>= `  n ) A. k  e.  ( ZZ>= `  j ) A. z  e.  S  ( abs `  ( ( ( F `
 k ) `  z )  -  ( G `  z )
) )  <  x
) )
5 simp1 955 . . 3  |-  ( ( F : ( ZZ>= `  n ) --> ( CC 
^m  S )  /\  G : S --> CC  /\  A. x  e.  RR+  E. j  e.  ( ZZ>= `  n ) A. k  e.  ( ZZ>=
`  j ) A. z  e.  S  ( abs `  ( ( ( F `  k ) `
 z )  -  ( G `  z ) ) )  <  x
)  ->  F :
( ZZ>= `  n ) --> ( CC  ^m  S ) )
65reximi 2650 . 2  |-  ( E. n  e.  ZZ  ( F : ( ZZ>= `  n
) --> ( CC  ^m  S )  /\  G : S --> CC  /\  A. x  e.  RR+  E. j  e.  ( ZZ>= `  n ) A. k  e.  ( ZZ>=
`  j ) A. z  e.  S  ( abs `  ( ( ( F `  k ) `
 z )  -  ( G `  z ) ) )  <  x
)  ->  E. n  e.  ZZ  F : (
ZZ>= `  n ) --> ( CC  ^m  S ) )
74, 6syl 15 1  |-  ( F ( ~~> u `  S
) G  ->  E. n  e.  ZZ  F : (
ZZ>= `  n ) --> ( CC  ^m  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ w3a 934    e. wcel 1684   A.wral 2543   E.wrex 2544   _Vcvv 2788   class class class wbr 4023   -->wf 5251   ` cfv 5255  (class class class)co 5858    ^m cmap 6772   CCcc 8735    < clt 8867    - cmin 9037   ZZcz 10024   ZZ>=cuz 10230   RR+crp 10354   abscabs 11719   ~~> uculm 19755
This theorem is referenced by:  ulmpm  19762  ulmss  19774
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-cnex 8793  ax-resscn 8794
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-map 6774  df-pm 6775  df-neg 9040  df-z 10025  df-uz 10231  df-ulm 19756
  Copyright terms: Public domain W3C validator