ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  modqaddmulmod Unicode version
Theorem modqaddmulmod 10322
Description: The sum of a rational number and the product of a second rational number modulo a modulus and an integer equals the sum of the rational number and the product of the other rational number and the integer modulo the modulus. (Contributed by Jim Kingdon, 26-Oct-2021.)
Assertion
Ref Expression
modqaddmulmod |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A + ( ( B mod M ) x. C ) ) mod M ) = ( ( A + ( B x. C ) ) mod M ) )
Proof of Theorem modqaddmulmod
StepHypRef Expression
1 simpl1 990 . . . . 5 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> A e. QQ )
2 qcn 9568 . . . . 5 |- ( A e. QQ -> A e. CC )
31, 2syl 14 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> A e. CC )
4 simpl2 991 . . . . . . 7 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> B e. QQ )
5 simprl 521 . . . . . . 7 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> M e. QQ )
6 simprr 522 . . . . . . 7 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 < M )
74, 5, 6modqcld 10259 . . . . . 6 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( B mod M ) e. QQ )
8 simpl3 992 . . . . . . 7 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> C e. ZZ )
9 zq 9560 . . . . . . 7 |- ( C e. ZZ -> C e. QQ )
108, 9syl 14 . . . . . 6 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> C e. QQ )
11 qmulcl 9571 . . . . . 6 |- ( ( ( B mod M ) e. QQ /\ C e. QQ ) -> ( ( B mod M ) x. C ) e. QQ )
127, 10, 11syl2anc 409 . . . . 5 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( B mod M ) x. C ) e. QQ )
13 qcn 9568 . . . . 5 |- ( ( ( B mod M ) x. C ) e. QQ -> ( ( B mod M ) x. C ) e. CC )
1412, 13syl 14 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( B mod M ) x. C ) e. CC )
153, 14addcomd 8045 . . 3 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A + ( ( B mod M ) x. C ) ) = ( ( ( B mod M ) x. C ) + A ) )
1615oveq1d 5856 . 2 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A + ( ( B mod M ) x. C ) ) mod M ) = ( ( ( ( B mod M ) x. C ) + A ) mod M ) )
1793ad2ant3 1010 . . . . 5 |- ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) -> C e. QQ )
1817adantr 274 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> C e. QQ )
197, 18, 11syl2anc 409 . . 3 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( B mod M ) x. C ) e. QQ )
20 qmulcl 9571 . . . . 5 |- ( ( B e. QQ /\ C e. QQ ) -> ( B x. C ) e. QQ )
214, 18, 20syl2anc 409 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( B x. C ) e. QQ )
2221, 5, 6modqcld 10259 . . 3 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( B x. C ) mod M ) e. QQ )
23 modqmulmod 10320 . . . . 5 |- ( ( ( B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B mod M ) x. C ) mod M ) = ( ( B x. C ) mod M ) )
24233adantl1 1143 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B mod M ) x. C ) mod M ) = ( ( B x. C ) mod M ) )
25 modqabs2 10289 . . . . 5 |- ( ( ( B x. C ) e. QQ /\ M e. QQ /\ 0 < M ) -> ( ( ( B x. C ) mod M ) mod M ) = ( ( B x. C ) mod M ) )
2621, 5, 6, 25syl3anc 1228 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B x. C ) mod M ) mod M ) = ( ( B x. C ) mod M ) )
2724, 26eqtr4d 2201 . . 3 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B mod M ) x. C ) mod M ) = ( ( ( B x. C ) mod M ) mod M ) )
2819, 22, 1, 5, 6, 27modqadd1 10292 . 2 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( ( B mod M ) x. C ) + A ) mod M ) = ( ( ( ( B x. C ) mod M ) + A ) mod M ) )
29 modqaddmod 10294 . . . 4 |- ( ( ( ( B x. C ) e. QQ /\ A e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( ( B x. C ) mod M ) + A ) mod M ) = ( ( ( B x. C ) + A ) mod M ) )
3021, 1, 5, 6, 29syl22anc 1229 . . 3 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( ( B x. C ) mod M ) + A ) mod M ) = ( ( ( B x. C ) + A ) mod M ) )
31 qcn 9568 . . . . . 6 |- ( ( B x. C ) e. QQ -> ( B x. C ) e. CC )
3221, 31syl 14 . . . . 5 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( B x. C ) e. CC )
3332, 3addcomd 8045 . . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( B x. C ) + A ) = ( A + ( B x. C ) ) )
3433oveq1d 5856 . . 3 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B x. C ) + A ) mod M ) = ( ( A + ( B x. C ) ) mod M ) )
3530, 34eqtrd 2198 . 2 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( ( B x. C ) mod M ) + A ) mod M ) = ( ( A + ( B x. C ) ) mod M ) )
3616, 28, 353eqtrd 2202 1 |- ( ( ( A e. QQ /\ B e. QQ /\ C e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A + ( ( B mod M ) x. C ) ) mod M ) = ( ( A + ( B x. C ) ) mod M ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 103   /\ w3a 968   = wceq 1343   e. wcel 2136   class class class wbr 3981  (class class class)co 5841   CCcc 7747   0cc0 7749   + caddc 7752   x. cmul 7754   < clt 7929   ZZcz 9187   QQcq 9553   mod cmo 10253
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4099  ax-pow 4152  ax-pr 4186  ax-un 4410  ax-setind 4513  ax-cnex 7840  ax-resscn 7841  ax-1cn 7842  ax-1re 7843  ax-icn 7844  ax-addcl 7845  ax-addrcl 7846  ax-mulcl 7847  ax-mulrcl 7848  ax-addcom 7849  ax-mulcom 7850  ax-addass 7851  ax-mulass 7852  ax-distr 7853  ax-i2m1 7854  ax-0lt1 7855  ax-1rid 7856  ax-0id 7857  ax-rnegex 7858  ax-precex 7859  ax-cnre 7860  ax-pre-ltirr 7861  ax-pre-ltwlin 7862  ax-pre-lttrn 7863  ax-pre-apti 7864  ax-pre-ltadd 7865  ax-pre-mulgt0 7866  ax-pre-mulext 7867  ax-arch 7868
This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2296  df-ne 2336  df-nel 2431  df-ral 2448  df-rex 2449  df-reu 2450  df-rmo 2451  df-rab 2452  df-v 2727  df-sbc 2951  df-csb 3045  df-dif 3117  df-un 3119  df-in 3121  df-ss 3128  df-pw 3560  df-sn 3581  df-pr 3582  df-op 3584  df-uni 3789  df-int 3824  df-iun 3867  df-br 3982  df-opab 4043  df-mpt 4044  df-id 4270  df-po 4273  df-iso 4274  df-xp 4609  df-rel 4610  df-cnv 4611  df-co 4612  df-dm 4613  df-rn 4614  df-res 4615  df-ima 4616  df-iota 5152  df-fun 5189  df-fn 5190  df-f 5191  df-fv 5195  df-riota 5797  df-ov 5844  df-oprab 5845  df-mpo 5846  df-1st 6105  df-2nd 6106  df-pnf 7931  df-mnf 7932  df-xr 7933  df-ltxr 7934  df-le 7935  df-sub 8067  df-neg 8068  df-reap 8469  df-ap 8476  df-div 8565  df-inn 8854  df-n0 9111  df-z 9188  df-q 9554  df-rp 9586  df-fl 10201  df-mod 10254
This theorem is referenced by:  modprm0  12182  modprmn0modprm0  12184
  Copyright terms: Public domain W3C validator