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

Theorem mertenslemub 11490
Description: Lemma for mertensabs 11493. 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 2177 . . . . . . 7  |-  ( z  =  X  ->  (
z  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  <->  X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) ) ) )
32rexbidv 2471 . . . . . 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 2877 . . . . 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 146 . . 3  |-  ( ph  ->  E. n  e.  ( 0 ... ( S  -  1 ) ) X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) ) )
8 fvoveq1 5874 . . . . . . 7  |-  ( n  =  a  ->  ( ZZ>=
`  ( n  + 
1 ) )  =  ( ZZ>= `  ( a  +  1 ) ) )
98sumeq1d 11322 . . . . . 6  |-  ( n  =  a  ->  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
)  =  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `  k
) )
109fveq2d 5498 . . . . 5  |-  ( n  =  a  ->  ( abs `  sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) )
1110eqeq2d 2182 . . . 4  |-  ( n  =  a  ->  ( X  =  ( abs ` 
sum_ k  e.  (
ZZ>= `  ( n  + 
1 ) ) ( G `  k ) )  <->  X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) ) )
1211cbvrexv 2697 . . 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 121 . 2  |-  ( ph  ->  E. a  e.  ( 0 ... ( S  -  1 ) ) X  =  ( abs `  sum_ k  e.  (
ZZ>= `  ( a  +  1 ) ) ( G `  k ) ) )
14 simprr 527 . . 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 9217 . . . . 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 274 . . . . . . 7  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  S  e.  NN )
1817nnzd 9326 . . . . . 6  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  S  e.  ZZ )
19 1zzd 9232 . . . . . 6  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  1  e.  ZZ )
2018, 19zsubcld 9332 . . . . 5  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  ( S  -  1 )  e.  ZZ )
2115, 20fzfigd 10380 . . . 4  |-  ( (
ph  /\  ( a  e.  ( 0 ... ( S  -  1 ) )  /\  X  =  ( abs `  sum_ k  e.  ( ZZ>= `  ( a  +  1 ) ) ( G `
 k ) ) ) )  ->  (
0 ... ( S  - 
1 ) )  e. 
Fin )
22 eqid 2170 . . . . . . 7  |-  ( ZZ>= `  ( n  +  1
) )  =  (
ZZ>= `  ( n  + 
1 ) )
23 elfzelz 9974 . . . . . . . . 9  |-  ( n  e.  ( 0 ... ( S  -  1 ) )  ->  n  e.  ZZ )
2423adantl 275 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  n  e.  ZZ )
2524peano2zd 9330 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  (
n  +  1 )  e.  ZZ )
26 eqidd 2171 . . . . . . 7  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  ( G `  k )  =  ( G `  k ) )
27 simpll 524 . . . . . . . 8  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  ph )
28 elfznn0 10063 . . . . . . . . . . 11  |-  ( n  e.  ( 0 ... ( S  -  1 ) )  ->  n  e.  NN0 )
2928ad2antlr 486 . . . . . . . . . 10  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  ( ZZ>= `  ( n  +  1 ) ) )  ->  n  e.  NN0 )
30 peano2nn0 9168 . . . . . . . . . 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 9551 . . . . . . . . 9  |-  ( ( ( n  +  1 )  e.  NN0  /\  k  e.  ( ZZ>= `  ( n  +  1
) ) )  -> 
k  e.  NN0 )
3331, 32sylancom 418 . . . . . . . 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 2247 . . . . . . . 8  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( G `  k )  e.  CC )
3727, 33, 36syl2anc 409 . . . . . . 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 274 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  seq 0 (  +  ,  G )  e.  dom  ~~>  )
40 nn0uz 9514 . . . . . . . . 9  |-  NN0  =  ( ZZ>= `  0 )
4128adantl 275 . . . . . . . . . 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 474 . . . . . . . . 9  |-  ( ( ( ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  /\  k  e.  NN0 )  ->  ( G `  k )  e.  CC )
4440, 42, 43iserex 11295 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  (  seq 0 (  +  ,  G )  e.  dom  ~~>  <->  seq ( n  +  1
) (  +  ,  G )  e.  dom  ~~>  ) )
4539, 44mpbid 146 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  seq ( n  +  1
) (  +  ,  G )  e.  dom  ~~>  )
4622, 25, 26, 37, 45isumcl 11381 . . . . . 6  |-  ( (
ph  /\  n  e.  ( 0 ... ( S  -  1 ) ) )  ->  sum_ k  e.  ( ZZ>= `  ( n  +  1 ) ) ( G `  k
)  e.  CC )
4746adantlr 474 . . . . 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 11138 . . . 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 11141 . . . 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 526 . . . 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 11417 . . 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 4009 . 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 2592 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 103    <-> wb 104    = wceq 1348    e. wcel 2141   {cab 2156   E.wrex 2449   class class class wbr 3987   dom cdm 4609   ` cfv 5196  (class class class)co 5851   CCcc 7765   0cc0 7767   1c1 7768    + caddc 7770    <_ cle 7948    - cmin 8083   NNcn 8871   NN0cn0 9128   ZZcz 9205   ZZ>=cuz 9480   ...cfz 9958    seqcseq 10394   abscabs 10954    ~~> cli 11234   sum_csu 11309
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4102  ax-sep 4105  ax-nul 4113  ax-pow 4158  ax-pr 4192  ax-un 4416  ax-setind 4519  ax-iinf 4570  ax-cnex 7858  ax-resscn 7859  ax-1cn 7860  ax-1re 7861  ax-icn 7862  ax-addcl 7863  ax-addrcl 7864  ax-mulcl 7865  ax-mulrcl 7866  ax-addcom 7867  ax-mulcom 7868  ax-addass 7869  ax-mulass 7870  ax-distr 7871  ax-i2m1 7872  ax-0lt1 7873  ax-1rid 7874  ax-0id 7875  ax-rnegex 7876  ax-precex 7877  ax-cnre 7878  ax-pre-ltirr 7879  ax-pre-ltwlin 7880  ax-pre-lttrn 7881  ax-pre-apti 7882  ax-pre-ltadd 7883  ax-pre-mulgt0 7884  ax-pre-mulext 7885  ax-arch 7886  ax-caucvg 7887
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3526  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-int 3830  df-iun 3873  df-br 3988  df-opab 4049  df-mpt 4050  df-tr 4086  df-id 4276  df-po 4279  df-iso 4280  df-iord 4349  df-on 4351  df-ilim 4352  df-suc 4354  df-iom 4573  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-rn 4620  df-res 4621  df-ima 4622  df-iota 5158  df-fun 5198  df-fn 5199  df-f 5200  df-f1 5201  df-fo 5202  df-f1o 5203  df-fv 5204  df-isom 5205  df-riota 5807  df-ov 5854  df-oprab 5855  df-mpo 5856  df-1st 6117  df-2nd 6118  df-recs 6282  df-irdg 6347  df-frec 6368  df-1o 6393  df-oadd 6397  df-er 6511  df-en 6717  df-dom 6718  df-fin 6719  df-pnf 7949  df-mnf 7950  df-xr 7951  df-ltxr 7952  df-le 7953  df-sub 8085  df-neg 8086  df-reap 8487  df-ap 8494  df-div 8583  df-inn 8872  df-2 8930  df-3 8931  df-4 8932  df-n0 9129  df-z 9206  df-uz 9481  df-q 9572  df-rp 9604  df-ico 9844  df-fz 9959  df-fzo 10092  df-seqfrec 10395  df-exp 10469  df-ihash 10703  df-cj 10799  df-re 10800  df-im 10801  df-rsqrt 10955  df-abs 10956  df-clim 11235  df-sumdc 11310
This theorem is referenced by:  mertenslem2  11492
  Copyright terms: Public domain W3C validator