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

Theorem fsumdvds 12635
Description: If every term in a sum is divisible by  N, then so is the sum. (Contributed by Mario Carneiro, 17-Jan-2015.)
Hypotheses
Ref Expression
fsumdvds.1  |-  ( ph  ->  A  e.  Fin )
fsumdvds.2  |-  ( ph  ->  N  e.  ZZ )
fsumdvds.3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  ZZ )
fsumdvds.4  |-  ( (
ph  /\  k  e.  A )  ->  N  ||  B )
Assertion
Ref Expression
fsumdvds  |-  ( ph  ->  N  ||  sum_ k  e.  A  B )
Distinct variable groups:    A, k    k, N    ph, k
Allowed substitution hint:    B( k)

Proof of Theorem fsumdvds
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 0z 9667 . . . 4  |-  0  e.  ZZ
2 dvds0 12599 . . . 4  |-  ( 0  e.  ZZ  ->  0  ||  0 )
31, 2mp1i 10 . . 3  |-  ( (
ph  /\  N  = 
0 )  ->  0  ||  0 )
4 simpr 110 . . 3  |-  ( (
ph  /\  N  = 
0 )  ->  N  =  0 )
5 simplr 533 . . . . . . 7  |-  ( ( ( ph  /\  N  =  0 )  /\  k  e.  A )  ->  N  =  0 )
6 fsumdvds.4 . . . . . . . 8  |-  ( (
ph  /\  k  e.  A )  ->  N  ||  B )
76adantlr 481 . . . . . . 7  |-  ( ( ( ph  /\  N  =  0 )  /\  k  e.  A )  ->  N  ||  B )
85, 7eqbrtrrd 4155 . . . . . 6  |-  ( ( ( ph  /\  N  =  0 )  /\  k  e.  A )  ->  0  ||  B )
9 fsumdvds.3 . . . . . . . 8  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  ZZ )
109adantlr 481 . . . . . . 7  |-  ( ( ( ph  /\  N  =  0 )  /\  k  e.  A )  ->  B  e.  ZZ )
11 0dvds 12604 . . . . . . 7  |-  ( B  e.  ZZ  ->  (
0  ||  B  <->  B  = 
0 ) )
1210, 11syl 14 . . . . . 6  |-  ( ( ( ph  /\  N  =  0 )  /\  k  e.  A )  ->  ( 0  ||  B  <->  B  =  0 ) )
138, 12mpbid 147 . . . . 5  |-  ( ( ( ph  /\  N  =  0 )  /\  k  e.  A )  ->  B  =  0 )
1413sumeq2dv 12160 . . . 4  |-  ( (
ph  /\  N  = 
0 )  ->  sum_ k  e.  A  B  =  sum_ k  e.  A  0 )
15 fsumdvds.1 . . . . . . 7  |-  ( ph  ->  A  e.  Fin )
1615adantr 276 . . . . . 6  |-  ( (
ph  /\  N  = 
0 )  ->  A  e.  Fin )
1716olcd 746 . . . . 5  |-  ( (
ph  /\  N  = 
0 )  ->  (
( 0  e.  ZZ  /\  A  C_  ( ZZ>= ` 
0 )  /\  A. j  e.  ( ZZ>= ` 
0 )DECID  j  e.  A )  \/  A  e.  Fin ) )
18 isumz 12182 . . . . 5  |-  ( ( ( 0  e.  ZZ  /\  A  C_  ( ZZ>= ` 
0 )  /\  A. j  e.  ( ZZ>= ` 
0 )DECID  j  e.  A )  \/  A  e.  Fin )  ->  sum_ k  e.  A 
0  =  0 )
1917, 18syl 14 . . . 4  |-  ( (
ph  /\  N  = 
0 )  ->  sum_ k  e.  A  0  = 
0 )
2014, 19eqtrd 2271 . . 3  |-  ( (
ph  /\  N  = 
0 )  ->  sum_ k  e.  A  B  = 
0 )
213, 4, 203brtr4d 4163 . 2  |-  ( (
ph  /\  N  = 
0 )  ->  N  || 
sum_ k  e.  A  B )
2215adantr 276 . . . . 5  |-  ( (
ph  /\  N  =/=  0 )  ->  A  e.  Fin )
23 fsumdvds.2 . . . . . . 7  |-  ( ph  ->  N  e.  ZZ )
2423adantr 276 . . . . . 6  |-  ( (
ph  /\  N  =/=  0 )  ->  N  e.  ZZ )
2524zcnd 9781 . . . . 5  |-  ( (
ph  /\  N  =/=  0 )  ->  N  e.  CC )
269adantlr 481 . . . . . 6  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  B  e.  ZZ )
2726zcnd 9781 . . . . 5  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  B  e.  CC )
28 zapne 9731 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  0  e.  ZZ )  ->  ( N #  0  <->  N  =/=  0 ) )
2923, 1, 28sylancl 417 . . . . . 6  |-  ( ph  ->  ( N #  0  <->  N  =/=  0 ) )
3029biimpar 297 . . . . 5  |-  ( (
ph  /\  N  =/=  0 )  ->  N #  0 )
3122, 25, 27, 30fsumdivapc 12243 . . . 4  |-  ( (
ph  /\  N  =/=  0 )  ->  ( sum_ k  e.  A  B  /  N )  =  sum_ k  e.  A  ( B  /  N ) )
326adantlr 481 . . . . . 6  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  N  ||  B )
3324adantr 276 . . . . . . 7  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  N  e.  ZZ )
34 simplr 533 . . . . . . 7  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  N  =/=  0 )
35 dvdsval2 12583 . . . . . . 7  |-  ( ( N  e.  ZZ  /\  N  =/=  0  /\  B  e.  ZZ )  ->  ( N  ||  B  <->  ( B  /  N )  e.  ZZ ) )
3633, 34, 26, 35syl3anc 1278 . . . . . 6  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  ( N  ||  B  <->  ( B  /  N )  e.  ZZ ) )
3732, 36mpbid 147 . . . . 5  |-  ( ( ( ph  /\  N  =/=  0 )  /\  k  e.  A )  ->  ( B  /  N )  e.  ZZ )
3822, 37fsumzcl 12195 . . . 4  |-  ( (
ph  /\  N  =/=  0 )  ->  sum_ k  e.  A  ( B  /  N )  e.  ZZ )
3931, 38eqeltrd 2315 . . 3  |-  ( (
ph  /\  N  =/=  0 )  ->  ( sum_ k  e.  A  B  /  N )  e.  ZZ )
40 simpr 110 . . . 4  |-  ( (
ph  /\  N  =/=  0 )  ->  N  =/=  0 )
4115, 9fsumzcl 12195 . . . . 5  |-  ( ph  -> 
sum_ k  e.  A  B  e.  ZZ )
4241adantr 276 . . . 4  |-  ( (
ph  /\  N  =/=  0 )  ->  sum_ k  e.  A  B  e.  ZZ )
43 dvdsval2 12583 . . . 4  |-  ( ( N  e.  ZZ  /\  N  =/=  0  /\  sum_ k  e.  A  B  e.  ZZ )  ->  ( N  ||  sum_ k  e.  A  B 
<->  ( sum_ k  e.  A  B  /  N )  e.  ZZ ) )
4424, 40, 42, 43syl3anc 1278 . . 3  |-  ( (
ph  /\  N  =/=  0 )  ->  ( N  ||  sum_ k  e.  A  B 
<->  ( sum_ k  e.  A  B  /  N )  e.  ZZ ) )
4539, 44mpbird 167 . 2  |-  ( (
ph  /\  N  =/=  0 )  ->  N  || 
sum_ k  e.  A  B )
46 zdceq 9732 . . . 4  |-  ( ( N  e.  ZZ  /\  0  e.  ZZ )  -> DECID  N  =  0 )
4723, 1, 46sylancl 417 . . 3  |-  ( ph  -> DECID  N  =  0 )
48 dcne 2431 . . 3  |-  (DECID  N  =  0  <->  ( N  =  0  \/  N  =/=  0 ) )
4947, 48sylib 122 . 2  |-  ( ph  ->  ( N  =  0  \/  N  =/=  0
) )
5021, 45, 49mpjaodan 810 1  |-  ( ph  ->  N  ||  sum_ k  e.  A  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720  DECID wdc 846    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   A.wral 2528    C_ wss 3220   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   Fincfn 7027   0cc0 8186   # cap 8918    / cdiv 9011   ZZcz 9656   ZZ>=cuz 9938   sum_csu 12145    || cdvds 12580
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305  ax-caucvg 8306
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-oadd 6695  df-er 6811  df-en 7028  df-dom 7029  df-fin 7030  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-n0 9576  df-z 9657  df-uz 9939  df-q 10037  df-rp 10073  df-fz 10430  df-fzo 10568  df-seqfrec 10907  df-exp 10998  df-ihash 11238  df-cj 11630  df-re 11631  df-im 11632  df-rsqrt 11787  df-abs 11788  df-clim 12071  df-sumdc 12146  df-dvds 12581
This theorem is used by:  3dvds  12657
  Copyright terms: Public domain W3C validator