ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  modaddmodlo Unicode version
Theorem modaddmodlo 10313
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 10072 . . . . . . 7 |- ( B e. ( 0..^ ( M - ( A mod M ) ) ) -> B e. ZZ )
21adantl 275 . . . . . 6 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> B e. ZZ )
3 zq 9555 . . . . . 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 10269 . . . . . . . 8 |- ( ( A e. ZZ /\ M e. NN ) -> ( A mod M ) e. NN0 )
65adantr 274 . . . . . . 7 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> ( A mod M ) e. NN0 )
76nn0zd 9302 . . . . . 6 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> ( A mod M ) e. ZZ )
8 zq 9555 . . . . . 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 9564 . . . . 5 |- ( ( B e. QQ /\ ( A mod M ) e. QQ ) -> ( B + ( A mod M ) ) e. QQ )
114, 9, 10syl2anc 409 . . . 4 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> ( B + ( A mod M ) ) e. QQ )
12 simplr 520 . . . . 5 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> M e. NN )
13 nnq 9562 . . . . 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 9304 . . . . 5 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> B e. RR )
166nn0red 9159 . . . . 5 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> ( A mod M ) e. RR )
17 elfzole1 10080 . . . . . 6 |- ( B e. ( 0..^ ( M - ( A mod M ) ) ) -> 0 <_ B )
1817adantl 275 . . . . 5 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> 0 <_ B )
196nn0ge0d 9161 . . . . 5 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> 0 <_ ( A mod M ) )
2015, 16, 18, 19addge0d 8411 . . . 4 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> 0 <_ ( B + ( A mod M ) ) )
21 elfzolt2 10081 . . . . . 6 |- ( B e. ( 0..^ ( M - ( A mod M ) ) ) -> B < ( M - ( A mod M ) ) )
2221adantl 275 . . . . 5 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> B < ( M - ( A mod M ) ) )
2312nnred 8861 . . . . . 6 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> M e. RR )
2415, 16, 23ltaddsubd 8434 . . . . 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 166 . . . 4 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> ( B + ( A mod M ) ) < M )
26 modqid 10274 . . . 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 1228 . . 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 9555 . . . . 5 |- ( A e. ZZ -> A e. QQ )
2928ad2antrr 480 . . . 4 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> A e. QQ )
3012nngt0d 8892 . . . 4 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> 0 < M )
31 modqadd2mod 10299 . . . 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 1228 . . 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 2199 . 2 |- ( ( ( A e. ZZ /\ M e. NN ) /\ B e. ( 0..^ ( M - ( A mod M ) ) ) ) -> ( B + ( A mod M ) ) = ( ( B + A ) mod M ) )
3433ex 114 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 103   = wceq 1342   e. wcel 2135   class class class wbr 3976  (class class class)co 5836   0cc0 7744   + caddc 7747   < clt 7924   <_ cle 7925   - cmin 8060   NNcn 8848   NN0cn0 9105   ZZcz 9182   QQcq 9548  ..^cfzo 10067   mod cmo 10247
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405  ax-setind 4508  ax-cnex 7835  ax-resscn 7836  ax-1cn 7837  ax-1re 7838  ax-icn 7839  ax-addcl 7840  ax-addrcl 7841  ax-mulcl 7842  ax-mulrcl 7843  ax-addcom 7844  ax-mulcom 7845  ax-addass 7846  ax-mulass 7847  ax-distr 7848  ax-i2m1 7849  ax-0lt1 7850  ax-1rid 7851  ax-0id 7852  ax-rnegex 7853  ax-precex 7854  ax-cnre 7855  ax-pre-ltirr 7856  ax-pre-ltwlin 7857  ax-pre-lttrn 7858  ax-pre-apti 7859  ax-pre-ltadd 7860  ax-pre-mulgt0 7861  ax-pre-mulext 7862  ax-arch 7863
This theorem depends on definitions:  df-bi 116  df-3or 968  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-nel 2430  df-ral 2447  df-rex 2448  df-reu 2449  df-rmo 2450  df-rab 2451  df-v 2723  df-sbc 2947  df-csb 3041  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-int 3819  df-iun 3862  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-po 4268  df-iso 4269  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-f 5186  df-fv 5190  df-riota 5792  df-ov 5839  df-oprab 5840  df-mpo 5841  df-1st 6100  df-2nd 6101  df-pnf 7926  df-mnf 7927  df-xr 7928  df-ltxr 7929  df-le 7930  df-sub 8062  df-neg 8063  df-reap 8464  df-ap 8471  df-div 8560  df-inn 8849  df-n0 9106  df-z 9183  df-uz 9458  df-q 9549  df-rp 9581  df-fz 9936  df-fzo 10068  df-fl 10195  df-mod 10248
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator