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

Theorem modmulconst 12509
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 9596 . . . . 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 9618 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  -  B
)  e.  ZZ )
433adant3 1044 . . . . 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 9596 . . . . . . 7  |-  ( C  e.  NN  ->  C  e.  ZZ )
7 nnne0 9265 . . . . . . 7  |-  ( C  e.  NN  ->  C  =/=  0 )
86, 7jca 306 . . . . . 6  |-  ( C  e.  NN  ->  ( C  e.  ZZ  /\  C  =/=  0 ) )
983ad2ant3 1047 . . . . 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 12506 . . . . 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 1274 . . 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 9582 . . . . . . . 8  |-  ( A  e.  ZZ  ->  A  e.  CC )
15 zcn 9582 . . . . . . . 8  |-  ( B  e.  ZZ  ->  B  e.  CC )
16 nncn 9245 . . . . . . . 8  |-  ( C  e.  NN  ->  C  e.  CC )
1714, 15, 163anim123i 1211 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC ) )
18 3anrot 1010 . . . . . . 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 8658 . . . . . 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 4121 . . 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 1024 . . . 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 1025 . . . 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 12485 . . 3  |-  ( ( M  e.  NN  /\  A  e.  ZZ  /\  B  e.  ZZ )  ->  (
( A  mod  M
)  =  ( B  mod  M )  <->  M  ||  ( A  -  B )
) )
3125, 27, 29, 30syl3anc 1274 . 2  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( A  mod  M )  =  ( B  mod  M
)  <->  M  ||  ( A  -  B ) ) )
32 simpl3 1029 . . . 4  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  C  e.  NN )
3332, 25nnmulcld 9286 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( C  x.  M )  e.  NN )
3463ad2ant3 1047 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  ->  C  e.  ZZ )
3534, 26zmulcld 9706 . . . 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 9706 . . . 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 12485 . . 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 1274 . 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 1005    = wceq 1398    e. wcel 2203    =/= wne 2412   class class class wbr 4109  (class class class)co 6050   CCcc 8125   0cc0 8127    x. cmul 8132    - cmin 8444   NNcn 9237   ZZcz 9577    mod cmo 10684    || cdvds 12473
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245  ax-arch 8246
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-n0 9497  df-z 9578  df-q 9952  df-rp 9987  df-fl 10630  df-mod 10685  df-dvds 12474
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator