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

Theorem mertenslemub 12113
Description: Lemma for mertensabs 12116. 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 2238 . . . . . . 7  |-  ( z  =  X  ->  (
z  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  <->  X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) ) ) )
32rexbidv 2533 . . . . . 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 2953 . . . . 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 6041 . . . . . . 7  |-  ( n  =  a  ->  ( ZZ>=
`  ( n  + 
1 ) )  =  ( ZZ>= `  ( a  +  1 ) ) )
98sumeq1d 11944 . . . . . 6  |-  ( n  =  a  ->  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
)  =  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `  k
) )
109fveq2d 5643 . . . . 5  |-  ( n  =  a  ->  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) )
1110eqeq2d 2243 . . . 4  |-  ( n  =  a  ->  ( X  =  ( abs ` 
sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  <->  X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) ) )
1211cbvrexv 2768 . . 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 533 . . 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 9491 . . . . 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 9601 . . . . . 6  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  S  e.  ZZ )
19 1zzd 9506 . . . . . 6  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  1  e.  ZZ )
2018, 19zsubcld 9607 . . . . 5  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  ( S  -  1 )  e.  ZZ )
2115, 20fzfigd 10694 . . . 4  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  (
0 ... ( S  - 
1 ) )  e. 
Fin )
22 eqid 2231 . . . . . . 7  |-  ( ZZ>= `  ( n  +  1
) )  =  (
ZZ>= `  ( n  + 
1 ) )
23 elfzelz 10260 . . . . . . . . 9  |-  ( n  e.  ( 0 ... ( S  -  1 ) )  ->  n  e.  ZZ )
2423adantl 277 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  n  e.  ZZ )
2524peano2zd 9605 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  (
n  +  1 )  e.  ZZ )
26 eqidd 2232 . . . . . . 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 10349 . . . . . . . . . . 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 9442 . . . . . . . . . 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 9833 . . . . . . . . 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 2308 . . . . . . . 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 9791 . . . . . . . . 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 11917 . . . . . . . 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 12004 . . . . . 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 11759 . . . 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 11762 . . . 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 531 . . . 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 12040 . . 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 4110 . 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 2655 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 1397    e. wcel 2202   {cab 2217   E.wrex 2511   class class class wbr 4088   dom cdm 4725   ` cfv 5326  (class class class)co 6018   CCcc 8030   0cc0 8032   1c1 8033    + caddc 8035    <_ cle 8215    - cmin 8350   NNcn 9143   NN0cn0 9402   ZZcz 9479   ZZ>=cuz 9755   ...cfz 10243    seqcseq 10710   abscabs 11575    ~~> cli 11856   sum_csu 11931
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150  ax-arch 8151  ax-caucvg 8152
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-frec 6557  df-1o 6582  df-oadd 6586  df-er 6702  df-en 6910  df-dom 6911  df-fin 6912  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-n0 9403  df-z 9480  df-uz 9756  df-q 9854  df-rp 9889  df-ico 10129  df-fz 10244  df-fzo 10378  df-seqfrec 10711  df-exp 10802  df-ihash 11039  df-cj 11420  df-re 11421  df-im 11422  df-rsqrt 11576  df-abs 11577  df-clim 11857  df-sumdc 11932
This theorem is referenced by:  mertenslem2  12115
  Copyright terms: Public domain W3C validator