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

Theorem mertenslemub 11699
Description: Lemma for mertensabs 11702. An upper bound for  T. (Contributed by Jim Kingdon, 3-Dec-2022.)
Hypotheses
Ref Expression
mertenslemub.gb  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( G `  k )  =  B )
mertenslemub.b  |-  ( (
ph  /\  k  e.  NN0 )  ->  B  e.  CC )
mertenslemub.cvg  |-  ( ph  ->  seq 0 (  +  ,  G )  e. 
dom 
~~>  )
mertenslemub.t  |-  T  =  { z  |  E. n  e.  ( 0 ... ( S  - 
1 ) ) z  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) }
mertenslemub.elt  |-  ( ph  ->  X  e.  T )
mertenslemub.s  |-  ( ph  ->  S  e.  NN )
Assertion
Ref Expression
mertenslemub  |-  ( ph  ->  X  <_  sum_ n  e.  ( 0 ... ( S  -  1 ) ) ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) )
Distinct variable groups:    k, G, n, z    S, k, n, z   
n, X, z    ph, k, n
Allowed substitution hints:    ph( z)    B( z,
k, n)    T( z,
k, n)    X( k)

Proof of Theorem mertenslemub
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 mertenslemub.elt . . . 4  |-  ( ph  ->  X  e.  T )
2 eqeq1 2203 . . . . . . 7  |-  ( z  =  X  ->  (
z  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  <->  X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) ) ) )
32rexbidv 2498 . . . . . 6  |-  ( z  =  X  ->  ( E. n  e.  (
0 ... ( S  - 
1 ) ) z  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) )  <->  E. n  e.  (
0 ... ( S  - 
1 ) ) X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) ) )
4 mertenslemub.t . . . . . 6  |-  T  =  { z  |  E. n  e.  ( 0 ... ( S  - 
1 ) ) z  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) }
53, 4elab2g 2911 . . . . 5  |-  ( X  e.  T  ->  ( X  e.  T  <->  E. n  e.  ( 0 ... ( S  -  1 ) ) X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
) ) ) )
61, 5syl 14 . . . 4  |-  ( ph  ->  ( X  e.  T  <->  E. n  e.  ( 0 ... ( S  - 
1 ) ) X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) ) )
71, 6mpbid 147 . . 3  |-  ( ph  ->  E. n  e.  ( 0 ... ( S  -  1 ) ) X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) ) )
8 fvoveq1 5945 . . . . . . 7  |-  ( n  =  a  ->  ( ZZ>=
`  ( n  + 
1 ) )  =  ( ZZ>= `  ( a  +  1 ) ) )
98sumeq1d 11531 . . . . . 6  |-  ( n  =  a  ->  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
)  =  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `  k
) )
109fveq2d 5562 . . . . 5  |-  ( n  =  a  ->  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) )
1110eqeq2d 2208 . . . 4  |-  ( n  =  a  ->  ( X  =  ( abs ` 
sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  <->  X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) ) )
1211cbvrexv 2730 . . 3  |-  ( E. n  e.  ( 0 ... ( S  - 
1 ) ) X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) )  <->  E. a  e.  (
0 ... ( S  - 
1 ) ) X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) )
137, 12sylib 122 . 2  |-  ( ph  ->  E. a  e.  ( 0 ... ( S  -  1 ) ) X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) )
14 simprr 531 . . 3  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) )
15 0zd 9338 . . . . 5  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  0  e.  ZZ )
16 mertenslemub.s . . . . . . . 8  |-  ( ph  ->  S  e.  NN )
1716adantr 276 . . . . . . 7  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  S  e.  NN )
1817nnzd 9447 . . . . . 6  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  S  e.  ZZ )
19 1zzd 9353 . . . . . 6  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  1  e.  ZZ )
2018, 19zsubcld 9453 . . . . 5  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  ( S  -  1 )  e.  ZZ )
2115, 20fzfigd 10523 . . . 4  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  (
0 ... ( S  - 
1 ) )  e. 
Fin )
22 eqid 2196 . . . . . . 7  |-  ( ZZ>= `  ( n  +  1
) )  =  (
ZZ>= `  ( n  + 
1 ) )
23 elfzelz 10100 . . . . . . . . 9  |-  ( n  e.  ( 0 ... ( S  -  1 ) )  ->  n  e.  ZZ )
2423adantl 277 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  n  e.  ZZ )
2524peano2zd 9451 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  (
n  +  1 )  e.  ZZ )
26 eqidd 2197 . . . . . . 7  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  ( G `  k )  =  ( G `  k ) )
27 simpll 527 . . . . . . . 8  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  ph )
28 elfznn0 10189 . . . . . . . . . . 11  |-  ( n  e.  ( 0 ... ( S  -  1 ) )  ->  n  e.  NN0 )
2928ad2antlr 489 . . . . . . . . . 10  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  n  e.  NN0 )
30 peano2nn0 9289 . . . . . . . . . 10  |-  ( n  e.  NN0  ->  ( n  +  1 )  e. 
NN0 )
3129, 30syl 14 . . . . . . . . 9  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  ( n  +  1 )  e. 
NN0 )
32 eluznn0 9673 . . . . . . . . 9  |-  ( ( ( n  +  1 )  e.  NN0  /\  k  e.  ( ZZ>= `  ( n  +  1
) ) )  -> 
k  e.  NN0 )
3331, 32sylancom 420 . . . . . . . 8  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  k  e.  NN0 )
34 mertenslemub.gb . . . . . . . . 9  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( G `  k )  =  B )
35 mertenslemub.b . . . . . . . . 9  |-  ( (
ph  /\  k  e.  NN0 )  ->  B  e.  CC )
3634, 35eqeltrd 2273 . . . . . . . 8  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( G `  k )  e.  CC )
3727, 33, 36syl2anc 411 . . . . . . 7  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  ( G `  k )  e.  CC )
38 mertenslemub.cvg . . . . . . . . 9  |-  ( ph  ->  seq 0 (  +  ,  G )  e. 
dom 
~~>  )
3938adantr 276 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  seq 0 (  +  ,  G )  e.  dom  ~~>  )
40 nn0uz 9636 . . . . . . . . 9  |-  NN0  =  ( ZZ>= `  0 )
4128adantl 277 . . . . . . . . . 10  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  n  e.  NN0 )
4241, 30syl 14 . . . . . . . . 9  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  (
n  +  1 )  e.  NN0 )
4336adantlr 477 . . . . . . . . 9  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  NN0 )  ->  ( G `  k )  e.  CC )
4440, 42, 43iserex 11504 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  (  seq 0 (  +  ,  G )  e.  dom  ~~>  <->  seq ( n  +  1
) (  +  ,  G )  e.  dom  ~~>  ) )
4539, 44mpbid 147 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  seq ( n  +  1
) (  +  ,  G )  e.  dom  ~~>  )
4622, 25, 26, 37, 45isumcl 11590 . . . . . 6  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
)  e.  CC )
4746adantlr 477 . . . . 5  |-  ( ( ( ph  /\  (
a  e.  ( 0 ... ( S  - 
1 ) )  /\  X  =  ( abs ` 
sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) ) )  /\  n  e.  ( 0 ... ( S  - 
1 ) ) )  ->  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k )  e.  CC )
4847abscld 11346 . . . 4  |-  ( ( ( ph  /\  (
a  e.  ( 0 ... ( S  - 
1 ) )  /\  X  =  ( abs ` 
sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) ) )  /\  n  e.  ( 0 ... ( S  - 
1 ) ) )  ->  ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) )  e.  RR )
4947absge0d 11349 . . . 4  |-  ( ( ( ph  /\  (
a  e.  ( 0 ... ( S  - 
1 ) )  /\  X  =  ( abs ` 
sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) ) )  /\  n  e.  ( 0 ... ( S  - 
1 ) ) )  ->  0  <_  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) ) )
50 simprl 529 . . . 4  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  a  e.  ( 0 ... ( S  -  1 ) ) )
5121, 48, 49, 10, 50fsumge1 11626 . . 3  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) )  <_  sum_ n  e.  ( 0 ... ( S  -  1 ) ) ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) )
5214, 51eqbrtrd 4055 . 2  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  X  <_ 
sum_ n  e.  (
0 ... ( S  - 
1 ) ) ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
) ) )
5313, 52rexlimddv 2619 1  |-  ( ph  ->  X  <_  sum_ n  e.  ( 0 ... ( S  -  1 ) ) ( abs `  sum_ k  e.  ( ZZ>= `  ( n  +  1
) ) ( G `
 k ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2167   {cab 2182   E.wrex 2476   class class class wbr 4033   dom cdm 4663   ` cfv 5258  (class class class)co 5922   CCcc 7877   0cc0 7879   1c1 7880    + caddc 7882    <_ cle 8062    - cmin 8197   NNcn 8990   NN0cn0 9249   ZZcz 9326   ZZ>=cuz 9601   ...cfz 10083    seqcseq 10539   abscabs 11162    ~~> cli 11443   sum_csu 11518
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997  ax-arch 7998  ax-caucvg 7999
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-isom 5267  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-irdg 6428  df-frec 6449  df-1o 6474  df-oadd 6478  df-er 6592  df-en 6800  df-dom 6801  df-fin 6802  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-2 9049  df-3 9050  df-4 9051  df-n0 9250  df-z 9327  df-uz 9602  df-q 9694  df-rp 9729  df-ico 9969  df-fz 10084  df-fzo 10218  df-seqfrec 10540  df-exp 10631  df-ihash 10868  df-cj 11007  df-re 11008  df-im 11009  df-rsqrt 11163  df-abs 11164  df-clim 11444  df-sumdc 11519
This theorem is referenced by:  mertenslem2  11701
  Copyright terms: Public domain W3C validator