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

Theorem cau3 11666
Description: Convert between three-quantifier and four-quantifier versions of the Cauchy criterion. (In particular, the four-quantifier version has no occurrence of  j in the assertion, so it can be used with rexanuz 11539 and friends.) (Contributed by Mario Carneiro, 15-Feb-2014.)
Hypothesis
Ref Expression
cau3.1  |-  Z  =  ( ZZ>= `  M )
Assertion
Ref Expression
cau3  |-  ( A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( ( F `  k )  e.  CC  /\  ( abs `  (
( F `  k
)  -  ( F `
 j ) ) )  <  x )  <->  A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( ( F `  k )  e.  CC  /\ 
A. m  e.  (
ZZ>= `  k ) ( abs `  ( ( F `  k )  -  ( F `  m ) ) )  <  x ) )
Distinct variable groups:    j, k, m, x, F    j, M, k, x    j, Z, k, x
Allowed substitution hints:    M( m)    Z( m)

Proof of Theorem cau3
StepHypRef Expression
1 cau3.1 . . . 4  |-  Z  =  ( ZZ>= `  M )
2 uzssz 9766 . . . 4  |-  ( ZZ>= `  M )  C_  ZZ
31, 2eqsstri 3257 . . 3  |-  Z  C_  ZZ
4 id 19 . . 3  |-  ( ( F `  k )  e.  CC  ->  ( F `  k )  e.  CC )
5 eleq1 2292 . . 3  |-  ( ( F `  k )  =  ( F `  j )  ->  (
( F `  k
)  e.  CC  <->  ( F `  j )  e.  CC ) )
6 eleq1 2292 . . 3  |-  ( ( F `  k )  =  ( F `  m )  ->  (
( F `  k
)  e.  CC  <->  ( F `  m )  e.  CC ) )
7 abssub 11652 . . . 4  |-  ( ( ( F `  j
)  e.  CC  /\  ( F `  k )  e.  CC )  -> 
( abs `  (
( F `  j
)  -  ( F `
 k ) ) )  =  ( abs `  ( ( F `  k )  -  ( F `  j )
) ) )
873adant1 1039 . . 3  |-  ( ( T.  /\  ( F `
 j )  e.  CC  /\  ( F `
 k )  e.  CC )  ->  ( abs `  ( ( F `
 j )  -  ( F `  k ) ) )  =  ( abs `  ( ( F `  k )  -  ( F `  j ) ) ) )
9 abssub 11652 . . . 4  |-  ( ( ( F `  m
)  e.  CC  /\  ( F `  j )  e.  CC )  -> 
( abs `  (
( F `  m
)  -  ( F `
 j ) ) )  =  ( abs `  ( ( F `  j )  -  ( F `  m )
) ) )
1093adant1 1039 . . 3  |-  ( ( T.  /\  ( F `
 m )  e.  CC  /\  ( F `
 j )  e.  CC )  ->  ( abs `  ( ( F `
 m )  -  ( F `  j ) ) )  =  ( abs `  ( ( F `  j )  -  ( F `  m ) ) ) )
11 abs3lem 11662 . . . 4  |-  ( ( ( ( F `  k )  e.  CC  /\  ( F `  m
)  e.  CC )  /\  ( ( F `
 j )  e.  CC  /\  x  e.  RR ) )  -> 
( ( ( abs `  ( ( F `  k )  -  ( F `  j )
) )  <  (
x  /  2 )  /\  ( abs `  (
( F `  j
)  -  ( F `
 m ) ) )  <  ( x  /  2 ) )  ->  ( abs `  (
( F `  k
)  -  ( F `
 m ) ) )  <  x ) )
12113adant1 1039 . . 3  |-  ( ( T.  /\  ( ( F `  k )  e.  CC  /\  ( F `  m )  e.  CC )  /\  (
( F `  j
)  e.  CC  /\  x  e.  RR )
)  ->  ( (
( abs `  (
( F `  k
)  -  ( F `
 j ) ) )  <  ( x  /  2 )  /\  ( abs `  ( ( F `  j )  -  ( F `  m ) ) )  <  ( x  / 
2 ) )  -> 
( abs `  (
( F `  k
)  -  ( F `
 m ) ) )  <  x ) )
133, 4, 5, 6, 8, 10, 12cau3lem 11665 . 2  |-  ( T. 
->  ( A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>=
`  j ) ( ( F `  k
)  e.  CC  /\  ( abs `  ( ( F `  k )  -  ( F `  j ) ) )  <  x )  <->  A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( ( F `  k )  e.  CC  /\ 
A. m  e.  (
ZZ>= `  k ) ( abs `  ( ( F `  k )  -  ( F `  m ) ) )  <  x ) ) )
1413mptru 1404 1  |-  ( A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( ( F `  k )  e.  CC  /\  ( abs `  (
( F `  k
)  -  ( F `
 j ) ) )  <  x )  <->  A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( ( F `  k )  e.  CC  /\ 
A. m  e.  (
ZZ>= `  k ) ( abs `  ( ( F `  k )  -  ( F `  m ) ) )  <  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395   T. wtru 1396    e. wcel 2200   A.wral 2508   E.wrex 2509   class class class wbr 4086   ` cfv 5324  (class class class)co 6013   CCcc 8020   RRcr 8021    < clt 8204    - cmin 8340    / cdiv 8842   2c2 9184   ZZcz 9469   ZZ>=cuz 9745   RR+crp 9878   abscabs 11548
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 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140  ax-arch 8141  ax-caucvg 8142
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 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-div 8843  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-n0 9393  df-z 9470  df-uz 9746  df-rp 9879  df-seqfrec 10700  df-exp 10791  df-cj 11393  df-re 11394  df-im 11395  df-rsqrt 11549  df-abs 11550
This theorem is referenced by:  cau4  11667  serf0  11903
  Copyright terms: Public domain W3C validator