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

Theorem iscau 18718
Description: Express the property " F is a Cauchy sequence of metric  D." Part of Definition 1.4-3 of [Kreyszig] p. 28. The condition  F  C_  ( CC  X.  X ) allows us to use objects more general than sequences when convenient; see the comment in df-lm 16975. (Contributed by NM, 7-Dec-2006.) (Revised by Mario Carneiro, 14-Nov-2013.)
Assertion
Ref Expression
iscau  |-  ( D  e.  ( * Met `  X )  ->  ( F  e.  ( Cau `  D )  <->  ( F  e.  ( X  ^pm  CC )  /\  A. x  e.  RR+  E. k  e.  ZZ  ( F  |`  ( ZZ>= `  k ) ) : ( ZZ>= `  k ) --> ( ( F `  k ) ( ball `  D ) x ) ) ) )
Distinct variable groups:    x, k, D    k, F, x    k, X, x

Proof of Theorem iscau
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 caufval 18717 . . 3  |-  ( D  e.  ( * Met `  X )  ->  ( Cau `  D )  =  { f  e.  ( X  ^pm  CC )  |  A. x  e.  RR+  E. k  e.  ZZ  (
f  |`  ( ZZ>= `  k
) ) : (
ZZ>= `  k ) --> ( ( f `  k
) ( ball `  D
) x ) } )
21eleq2d 2363 . 2  |-  ( D  e.  ( * Met `  X )  ->  ( F  e.  ( Cau `  D )  <->  F  e.  { f  e.  ( X 
^pm  CC )  |  A. x  e.  RR+  E. k  e.  ZZ  ( f  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( f `  k ) ( ball `  D
) x ) } ) )
3 reseq1 4965 . . . . . . 7  |-  ( f  =  F  ->  (
f  |`  ( ZZ>= `  k
) )  =  ( F  |`  ( ZZ>= `  k ) ) )
43feq1d 5395 . . . . . 6  |-  ( f  =  F  ->  (
( f  |`  ( ZZ>=
`  k ) ) : ( ZZ>= `  k
) --> ( ( f `
 k ) (
ball `  D )
x )  <->  ( F  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( f `  k ) ( ball `  D
) x ) ) )
5 eqidd 2297 . . . . . . 7  |-  ( f  =  F  ->  ( ZZ>=
`  k )  =  ( ZZ>= `  k )
)
6 fveq1 5540 . . . . . . . 8  |-  ( f  =  F  ->  (
f `  k )  =  ( F `  k ) )
76oveq1d 5889 . . . . . . 7  |-  ( f  =  F  ->  (
( f `  k
) ( ball `  D
) x )  =  ( ( F `  k ) ( ball `  D ) x ) )
85, 7feq23d 5402 . . . . . 6  |-  ( f  =  F  ->  (
( F  |`  ( ZZ>=
`  k ) ) : ( ZZ>= `  k
) --> ( ( f `
 k ) (
ball `  D )
x )  <->  ( F  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( F `  k ) ( ball `  D
) x ) ) )
94, 8bitrd 244 . . . . 5  |-  ( f  =  F  ->  (
( f  |`  ( ZZ>=
`  k ) ) : ( ZZ>= `  k
) --> ( ( f `
 k ) (
ball `  D )
x )  <->  ( F  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( F `  k ) ( ball `  D
) x ) ) )
109rexbidv 2577 . . . 4  |-  ( f  =  F  ->  ( E. k  e.  ZZ  ( f  |`  ( ZZ>=
`  k ) ) : ( ZZ>= `  k
) --> ( ( f `
 k ) (
ball `  D )
x )  <->  E. k  e.  ZZ  ( F  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( F `  k ) ( ball `  D
) x ) ) )
1110ralbidv 2576 . . 3  |-  ( f  =  F  ->  ( A. x  e.  RR+  E. k  e.  ZZ  ( f  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( f `  k ) ( ball `  D
) x )  <->  A. x  e.  RR+  E. k  e.  ZZ  ( F  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( F `  k ) ( ball `  D
) x ) ) )
1211elrab 2936 . 2  |-  ( F  e.  { f  e.  ( X  ^pm  CC )  |  A. x  e.  RR+  E. k  e.  ZZ  ( f  |`  ( ZZ>= `  k )
) : ( ZZ>= `  k ) --> ( ( f `  k ) ( ball `  D
) x ) }  <-> 
( F  e.  ( X  ^pm  CC )  /\  A. x  e.  RR+  E. k  e.  ZZ  ( F  |`  ( ZZ>= `  k
) ) : (
ZZ>= `  k ) --> ( ( F `  k
) ( ball `  D
) x ) ) )
132, 12syl6bb 252 1  |-  ( D  e.  ( * Met `  X )  ->  ( F  e.  ( Cau `  D )  <->  ( F  e.  ( X  ^pm  CC )  /\  A. x  e.  RR+  E. k  e.  ZZ  ( F  |`  ( ZZ>= `  k ) ) : ( ZZ>= `  k ) --> ( ( F `  k ) ( ball `  D ) x ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   A.wral 2556   E.wrex 2557   {crab 2560    |` cres 4707   -->wf 5267   ` cfv 5271  (class class class)co 5874    ^pm cpm 6789   CCcc 8751   ZZcz 10040   ZZ>=cuz 10246   RR+crp 10370   * Metcxmt 16385   ballcbl 16387   Caucca 18695
This theorem is referenced by:  iscau2  18719  caufpm  18724  lmcau  18754
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528  ax-cnex 8809  ax-resscn 8810
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-map 6790  df-xr 8887  df-xmet 16389  df-cau 18698
  Copyright terms: Public domain W3C validator