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

Theorem modaddmodlo 10640
Description: The sum of an integer modulo a positive integer and another integer equals the sum of the two integers modulo the positive integer if the other integer is in the lower part of the range between 0 and the positive integer. (Contributed by AV, 30-Oct-2018.)
Assertion
Ref Expression
modaddmodlo  |-  ( ( A  e.  ZZ  /\  M  e.  NN )  ->  ( B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) )  ->  ( B  +  ( A  mod  M ) )  =  ( ( B  +  A )  mod  M
) ) )

Proof of Theorem modaddmodlo
StepHypRef Expression
1 elfzoelz 10372 . . . . . . 7  |-  ( B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) )  ->  B  e.  ZZ )
21adantl 277 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  B  e.  ZZ )
3 zq 9850 . . . . . 6  |-  ( B  e.  ZZ  ->  B  e.  QQ )
42, 3syl 14 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  B  e.  QQ )
5 zmodcl 10596 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  M  e.  NN )  ->  ( A  mod  M
)  e.  NN0 )
65adantr 276 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( A  mod  M
)  e.  NN0 )
76nn0zd 9590 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( A  mod  M
)  e.  ZZ )
8 zq 9850 . . . . . 6  |-  ( ( A  mod  M )  e.  ZZ  ->  ( A  mod  M )  e.  QQ )
97, 8syl 14 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( A  mod  M
)  e.  QQ )
10 qaddcl 9859 . . . . 5  |-  ( ( B  e.  QQ  /\  ( A  mod  M )  e.  QQ )  -> 
( B  +  ( A  mod  M ) )  e.  QQ )
114, 9, 10syl2anc 411 . . . 4  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( B  +  ( A  mod  M ) )  e.  QQ )
12 simplr 528 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  M  e.  NN )
13 nnq 9857 . . . . 5  |-  ( M  e.  NN  ->  M  e.  QQ )
1412, 13syl 14 . . . 4  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  M  e.  QQ )
152zred 9592 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  B  e.  RR )
166nn0red 9446 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( A  mod  M
)  e.  RR )
17 elfzole1 10381 . . . . . 6  |-  ( B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) )  ->  0  <_  B )
1817adantl 277 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
0  <_  B )
196nn0ge0d 9448 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
0  <_  ( A  mod  M ) )
2015, 16, 18, 19addge0d 8692 . . . 4  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
0  <_  ( B  +  ( A  mod  M ) ) )
21 elfzolt2 10382 . . . . . 6  |-  ( B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) )  ->  B  <  ( M  -  ( A  mod  M ) ) )
2221adantl 277 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  B  <  ( M  -  ( A  mod  M ) ) )
2312nnred 9146 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  M  e.  RR )
2415, 16, 23ltaddsubd 8715 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( ( B  +  ( A  mod  M ) )  <  M  <->  B  <  ( M  -  ( A  mod  M ) ) ) )
2522, 24mpbird 167 . . . 4  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( B  +  ( A  mod  M ) )  <  M )
26 modqid 10601 . . . 4  |-  ( ( ( ( B  +  ( A  mod  M ) )  e.  QQ  /\  M  e.  QQ )  /\  ( 0  <_  ( B  +  ( A  mod  M ) )  /\  ( B  +  ( A  mod  M ) )  <  M ) )  ->  ( ( B  +  ( A  mod  M ) )  mod  M
)  =  ( B  +  ( A  mod  M ) ) )
2711, 14, 20, 25, 26syl22anc 1272 . . 3  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( ( B  +  ( A  mod  M ) )  mod  M )  =  ( B  +  ( A  mod  M ) ) )
28 zq 9850 . . . . 5  |-  ( A  e.  ZZ  ->  A  e.  QQ )
2928ad2antrr 488 . . . 4  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  ->  A  e.  QQ )
3012nngt0d 9177 . . . 4  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
0  <  M )
31 modqadd2mod 10626 . . . 4  |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( B  +  ( A  mod  M ) )  mod  M )  =  ( ( B  +  A )  mod 
M ) )
3229, 4, 14, 30, 31syl22anc 1272 . . 3  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( ( B  +  ( A  mod  M ) )  mod  M )  =  ( ( B  +  A )  mod 
M ) )
3327, 32eqtr3d 2264 . 2  |-  ( ( ( A  e.  ZZ  /\  M  e.  NN )  /\  B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) ) )  -> 
( B  +  ( A  mod  M ) )  =  ( ( B  +  A )  mod  M ) )
3433ex 115 1  |-  ( ( A  e.  ZZ  /\  M  e.  NN )  ->  ( B  e.  ( 0..^ ( M  -  ( A  mod  M ) ) )  ->  ( B  +  ( A  mod  M ) )  =  ( ( B  +  A )  mod  M
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   class class class wbr 4086  (class class class)co 6013   0cc0 8022    + caddc 8025    < clt 8204    <_ cle 8205    - cmin 8340   NNcn 9133   NN0cn0 9392   ZZcz 9469   QQcq 9843  ..^cfzo 10367    mod cmo 10574
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 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140  ax-arch 8141
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 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-div 8843  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746  df-q 9844  df-rp 9879  df-fz 10234  df-fzo 10368  df-fl 10520  df-mod 10575
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator