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

Theorem modmulconst 12371
Description: Constant multiplication in a modulo operation, see theorem 5.3 in [ApostolNT] p. 108. (Contributed by AV, 21-Jul-2021.)
Assertion
Ref Expression
modmulconst  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( A  mod  M )  =  ( B  mod  M
)  <->  ( ( C  x.  A )  mod  ( C  x.  M
) )  =  ( ( C  x.  B
)  mod  ( C  x.  M ) ) ) )

Proof of Theorem modmulconst
StepHypRef Expression
1 nnz 9486 . . . . 5  |-  ( M  e.  NN  ->  M  e.  ZZ )
21adantl 277 . . . 4  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  M  e.  ZZ )
3 zsubcl 9508 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  -  B
)  e.  ZZ )
433adant3 1041 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( A  -  B )  e.  ZZ )
54adantr 276 . . . 4  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( A  -  B )  e.  ZZ )
6 nnz 9486 . . . . . . 7  |-  ( C  e.  NN  ->  C  e.  ZZ )
7 nnne0 9159 . . . . . . 7  |-  ( C  e.  NN  ->  C  =/=  0 )
86, 7jca 306 . . . . . 6  |-  ( C  e.  NN  ->  ( C  e.  ZZ  /\  C  =/=  0 ) )
983ad2ant3 1044 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( C  e.  ZZ  /\  C  =/=  0 ) )
109adantr 276 . . . 4  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( C  e.  ZZ  /\  C  =/=  0 ) )
11 dvdscmulr 12368 . . . . 5  |-  ( ( M  e.  ZZ  /\  ( A  -  B
)  e.  ZZ  /\  ( C  e.  ZZ  /\  C  =/=  0 ) )  ->  ( ( C  x.  M )  ||  ( C  x.  ( A  -  B )
)  <->  M  ||  ( A  -  B ) ) )
1211bicomd 141 . . . 4  |-  ( ( M  e.  ZZ  /\  ( A  -  B
)  e.  ZZ  /\  ( C  e.  ZZ  /\  C  =/=  0 ) )  ->  ( M  ||  ( A  -  B
)  <->  ( C  x.  M )  ||  ( C  x.  ( A  -  B ) ) ) )
132, 5, 10, 12syl3anc 1271 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( M  ||  ( A  -  B
)  <->  ( C  x.  M )  ||  ( C  x.  ( A  -  B ) ) ) )
14 zcn 9472 . . . . . . . 8  |-  ( A  e.  ZZ  ->  A  e.  CC )
15 zcn 9472 . . . . . . . 8  |-  ( B  e.  ZZ  ->  B  e.  CC )
16 nncn 9139 . . . . . . . 8  |-  ( C  e.  NN  ->  C  e.  CC )
1714, 15, 163anim123i 1208 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC ) )
18 3anrot 1007 . . . . . . 7  |-  ( ( C  e.  CC  /\  A  e.  CC  /\  B  e.  CC )  <->  ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC ) )
1917, 18sylibr 134 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( C  e.  CC  /\  A  e.  CC  /\  B  e.  CC ) )
20 subdi 8552 . . . . . 6  |-  ( ( C  e.  CC  /\  A  e.  CC  /\  B  e.  CC )  ->  ( C  x.  ( A  -  B ) )  =  ( ( C  x.  A )  -  ( C  x.  B )
) )
2119, 20syl 14 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( C  x.  ( A  -  B ) )  =  ( ( C  x.  A )  -  ( C  x.  B )
) )
2221adantr 276 . . . 4  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( C  x.  ( A  -  B
) )  =  ( ( C  x.  A
)  -  ( C  x.  B ) ) )
2322breq2d 4096 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( C  x.  M )  ||  ( C  x.  ( A  -  B )
)  <->  ( C  x.  M )  ||  (
( C  x.  A
)  -  ( C  x.  B ) ) ) )
2413, 23bitrd 188 . 2  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( M  ||  ( A  -  B
)  <->  ( C  x.  M )  ||  (
( C  x.  A
)  -  ( C  x.  B ) ) ) )
25 simpr 110 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  M  e.  NN )
26 simp1 1021 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  A  e.  ZZ )
2726adantr 276 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  A  e.  ZZ )
28 simp2 1022 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  B  e.  ZZ )
2928adantr 276 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  B  e.  ZZ )
30 moddvds 12347 . . 3  |-  ( ( M  e.  NN  /\  A  e.  ZZ  /\  B  e.  ZZ )  ->  (
( A  mod  M
)  =  ( B  mod  M )  <->  M  ||  ( A  -  B )
) )
3125, 27, 29, 30syl3anc 1271 . 2  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( A  mod  M )  =  ( B  mod  M
)  <->  M  ||  ( A  -  B ) ) )
32 simpl3 1026 . . . 4  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  C  e.  NN )
3332, 25nnmulcld 9180 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( C  x.  M )  e.  NN )
3463ad2ant3 1044 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  C  e.  ZZ )
3534, 26zmulcld 9596 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( C  x.  A )  e.  ZZ )
3635adantr 276 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( C  x.  A )  e.  ZZ )
3734, 28zmulcld 9596 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( C  x.  B )  e.  ZZ )
3837adantr 276 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( C  x.  B )  e.  ZZ )
39 moddvds 12347 . . 3  |-  ( ( ( C  x.  M
)  e.  NN  /\  ( C  x.  A
)  e.  ZZ  /\  ( C  x.  B
)  e.  ZZ )  ->  ( ( ( C  x.  A )  mod  ( C  x.  M ) )  =  ( ( C  x.  B )  mod  ( C  x.  M )
)  <->  ( C  x.  M )  ||  (
( C  x.  A
)  -  ( C  x.  B ) ) ) )
4033, 36, 38, 39syl3anc 1271 . 2  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( ( C  x.  A )  mod  ( C  x.  M ) )  =  ( ( C  x.  B )  mod  ( C  x.  M )
)  <->  ( C  x.  M )  ||  (
( C  x.  A
)  -  ( C  x.  B ) ) ) )
4124, 31, 403bitr4d 220 1  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( A  mod  M )  =  ( B  mod  M
)  <->  ( ( C  x.  A )  mod  ( C  x.  M
) )  =  ( ( C  x.  B
)  mod  ( C  x.  M ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200    =/= wne 2400   class class class wbr 4084  (class class class)co 6011   CCcc 8018   0cc0 8020    x. cmul 8025    - cmin 8338   NNcn 9131   ZZcz 9467    mod cmo 10572    || cdvds 12335
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4203  ax-pow 4260  ax-pr 4295  ax-un 4526  ax-setind 4631  ax-cnex 8111  ax-resscn 8112  ax-1cn 8113  ax-1re 8114  ax-icn 8115  ax-addcl 8116  ax-addrcl 8117  ax-mulcl 8118  ax-mulrcl 8119  ax-addcom 8120  ax-mulcom 8121  ax-addass 8122  ax-mulass 8123  ax-distr 8124  ax-i2m1 8125  ax-0lt1 8126  ax-1rid 8127  ax-0id 8128  ax-rnegex 8129  ax-precex 8130  ax-cnre 8131  ax-pre-ltirr 8132  ax-pre-ltwlin 8133  ax-pre-lttrn 8134  ax-pre-apti 8135  ax-pre-ltadd 8136  ax-pre-mulgt0 8137  ax-pre-mulext 8138  ax-arch 8139
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3890  df-int 3925  df-iun 3968  df-br 4085  df-opab 4147  df-mpt 4148  df-id 4386  df-po 4389  df-iso 4390  df-xp 4727  df-rel 4728  df-cnv 4729  df-co 4730  df-dm 4731  df-rn 4732  df-res 4733  df-ima 4734  df-iota 5282  df-fun 5324  df-fn 5325  df-f 5326  df-fv 5330  df-riota 5964  df-ov 6014  df-oprab 6015  df-mpo 6016  df-1st 6296  df-2nd 6297  df-pnf 8204  df-mnf 8205  df-xr 8206  df-ltxr 8207  df-le 8208  df-sub 8340  df-neg 8341  df-reap 8743  df-ap 8750  df-div 8841  df-inn 9132  df-n0 9391  df-z 9468  df-q 9842  df-rp 9877  df-fl 10518  df-mod 10573  df-dvds 12336
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator