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

Theorem sgmmul 16116
Description: The divisor function for fixed parameter  A is a multiplicative function. (Contributed by Mario Carneiro, 2-Jul-2015.)
Assertion
Ref Expression
sgmmul  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( A  sigma  ( M  x.  N ) )  =  ( ( A  sigma  M )  x.  ( A  sigma  N ) ) )

Proof of Theorem sgmmul
Dummy variables  i  j  k  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr1 1034 . . 3  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  M  e.  NN )
2 simpr2 1035 . . 3  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  N  e.  NN )
3 simpr3 1036 . . 3  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( M  gcd  N )  =  1 )
4 eqid 2238 . . 3  |-  { x  e.  NN  |  x  ||  M }  =  {
x  e.  NN  |  x  ||  M }
5 eqid 2238 . . 3  |-  { x  e.  NN  |  x  ||  N }  =  {
x  e.  NN  |  x  ||  N }
6 eqid 2238 . . 3  |-  { x  e.  NN  |  x  ||  ( M  x.  N
) }  =  {
x  e.  NN  |  x  ||  ( M  x.  N ) }
7 ssrab2 3333 . . . . . 6  |-  { x  e.  NN  |  x  ||  M }  C_  NN
8 simpr 110 . . . . . 6  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  j  e.  {
x  e.  NN  |  x  ||  M } )  ->  j  e.  {
x  e.  NN  |  x  ||  M } )
97, 8sselid 3246 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  j  e.  {
x  e.  NN  |  x  ||  M } )  ->  j  e.  NN )
109nnrpd 10097 . . . 4  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  j  e.  {
x  e.  NN  |  x  ||  M } )  ->  j  e.  RR+ )
11 simpll 531 . . . 4  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  j  e.  {
x  e.  NN  |  x  ||  M } )  ->  A  e.  CC )
1210, 11rpcncxpcld 16035 . . 3  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  j  e.  {
x  e.  NN  |  x  ||  M } )  ->  ( j  ^c  A )  e.  CC )
13 ssrab2 3333 . . . . . 6  |-  { x  e.  NN  |  x  ||  N }  C_  NN
14 simpr 110 . . . . . 6  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  k  e.  {
x  e.  NN  |  x  ||  N } )  ->  k  e.  {
x  e.  NN  |  x  ||  N } )
1513, 14sselid 3246 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  k  e.  {
x  e.  NN  |  x  ||  N } )  ->  k  e.  NN )
1615nnrpd 10097 . . . 4  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  k  e.  {
x  e.  NN  |  x  ||  N } )  ->  k  e.  RR+ )
17 simpll 531 . . . 4  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  k  e.  {
x  e.  NN  |  x  ||  N } )  ->  A  e.  CC )
1816, 17rpcncxpcld 16035 . . 3  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  k  e.  {
x  e.  NN  |  x  ||  N } )  ->  ( k  ^c  A )  e.  CC )
199adantrr 483 . . . . . 6  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  -> 
j  e.  NN )
2019nnrpd 10097 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  -> 
j  e.  RR+ )
2115adantrl 482 . . . . . 6  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  -> 
k  e.  NN )
2221nnrpd 10097 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  -> 
k  e.  RR+ )
23 simpll 531 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  ->  A  e.  CC )
24 rpmulcxp 16017 . . . . 5  |-  ( ( j  e.  RR+  /\  k  e.  RR+  /\  A  e.  CC )  ->  (
( j  x.  k
)  ^c  A )  =  ( ( j  ^c  A )  x.  ( k  ^c  A ) ) )
2520, 22, 23, 24syl3anc 1278 . . . 4  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  -> 
( ( j  x.  k )  ^c  A )  =  ( ( j  ^c  A )  x.  (
k  ^c  A ) ) )
2625eqcomd 2244 . . 3  |-  ( ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  /\  ( j  e. 
{ x  e.  NN  |  x  ||  M }  /\  k  e.  { x  e.  NN  |  x  ||  N } ) )  -> 
( ( j  ^c  A )  x.  (
k  ^c  A ) )  =  ( ( j  x.  k
)  ^c  A ) )
27 oveq1 6092 . . 3  |-  ( i  =  ( j  x.  k )  ->  (
i  ^c  A )  =  ( ( j  x.  k )  ^c  A ) )
281, 2, 3, 4, 5, 6, 12, 18, 26, 27fsumdvdsmul 16111 . 2  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( sum_ j  e.  { x  e.  NN  |  x  ||  M } 
( j  ^c  A )  x.  sum_ k  e.  { x  e.  NN  |  x  ||  N }  ( k  ^c  A )
)  =  sum_ i  e.  { x  e.  NN  |  x  ||  ( M  x.  N ) }  ( i  ^c  A ) )
29 sgmval 16103 . . . 4  |-  ( ( A  e.  CC  /\  M  e.  NN )  ->  ( A  sigma  M )  =  sum_ j  e.  {
x  e.  NN  |  x  ||  M }  (
j  ^c  A ) )
301, 29syldan 282 . . 3  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( A  sigma  M )  =  sum_ j  e.  { x  e.  NN  |  x  ||  M } 
( j  ^c  A ) )
31 sgmval 16103 . . . 4  |-  ( ( A  e.  CC  /\  N  e.  NN )  ->  ( A  sigma  N )  =  sum_ k  e.  {
x  e.  NN  |  x  ||  N }  (
k  ^c  A ) )
322, 31syldan 282 . . 3  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( A  sigma  N )  =  sum_ k  e.  { x  e.  NN  |  x  ||  N } 
( k  ^c  A ) )
3330, 32oveq12d 6103 . 2  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( ( A 
sigma  M )  x.  ( A  sigma  N ) )  =  ( sum_ j  e.  { x  e.  NN  |  x  ||  M } 
( j  ^c  A )  x.  sum_ k  e.  { x  e.  NN  |  x  ||  N }  ( k  ^c  A )
) )
341, 2nnmulcld 9354 . . 3  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( M  x.  N )  e.  NN )
35 sgmval 16103 . . 3  |-  ( ( A  e.  CC  /\  ( M  x.  N
)  e.  NN )  ->  ( A  sigma  ( M  x.  N ) )  =  sum_ i  e.  { x  e.  NN  |  x  ||  ( M  x.  N ) }  ( i  ^c  A ) )
3634, 35syldan 282 . 2  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( A  sigma  ( M  x.  N ) )  =  sum_ i  e.  { x  e.  NN  |  x  ||  ( M  x.  N ) }  ( i  ^c  A ) )
3728, 33, 363eqtr4rd 2282 1  |-  ( ( A  e.  CC  /\  ( M  e.  NN  /\  N  e.  NN  /\  ( M  gcd  N )  =  1 ) )  ->  ( A  sigma  ( M  x.  N ) )  =  ( ( A  sigma  M )  x.  ( A  sigma  N ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   {crab 2532   class class class wbr 4130  (class class class)co 6085   CCcc 8177   1c1 8180    x. cmul 8184   NNcn 9305   RR+crp 10056   sum_csu 12121    || cdvds 12556    gcd cgcd 12732    ^c ccxp 15961    sigma csgm 16101
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299  ax-pre-suploc 8300  ax-addf 8301  ax-mulf 8302
This proof depends on definitions:  df-bi 117  df-stab 843  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-disj 4107  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-oadd 6691  df-er 6807  df-map 6924  df-pm 6925  df-en 7023  df-dom 7024  df-fin 7025  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8904  df-ap 8911  df-div 9004  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-n0 9566  df-z 9647  df-uz 9924  df-q 10022  df-rp 10057  df-xneg 10176  df-xadd 10177  df-ioo 10296  df-ico 10298  df-icc 10299  df-fz 10414  df-fzo 10552  df-fl 10707  df-mod 10762  df-seqfrec 10887  df-exp 10978  df-fac 11166  df-bc 11188  df-ihash 11217  df-shft 11582  df-cj 11609  df-re 11610  df-im 11611  df-rsqrt 11766  df-abs 11767  df-clim 12047  df-sumdc 12122  df-ef 12417  df-e 12418  df-dvds 12557  df-gcd 12733  df-rest 13597  df-topgen 13616  df-psmet 14882  df-xmet 14883  df-met 14884  df-bl 14885  df-mopn 14886  df-top 15101  df-topon 15114  df-bases 15146  df-ntr 15199  df-cn 15291  df-cnp 15292  df-tx 15356  df-cncf 15674  df-limced 15759  df-dvap 15760  df-relog 15962  df-rpcxp 15963  df-sgm 16102
This theorem is used by:  perfect1  16118  perfectlem1  16119  perfectlem2  16120
  Copyright terms: Public domain W3C validator