ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulqaddmodid Unicode version
Theorem mulqaddmodid 10581
Description: The sum of a positive rational number less than an upper bound and the product of an integer and the upper bound is the positive rational number modulo the upper bound. (Contributed by Jim Kingdon, 23-Oct-2021.)
Assertion
Ref Expression
mulqaddmodid |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( ( N x. M ) + A ) mod M ) = A )
Proof of Theorem mulqaddmodid
StepHypRef Expression
1 simpll 527 . . . . . 6 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> N e. ZZ )
21zcnd 9566 . . . . 5 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> N e. CC )
3 qre 9816 . . . . . . 7 |- ( M e. QQ -> M e. RR )
43ad2antlr 489 . . . . . 6 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. RR )
54recnd 8171 . . . . 5 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. CC )
62, 5mulcld 8163 . . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( N x. M ) e. CC )
7 simprr 531 . . . . . . 7 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. ( 0 [,) M ) )
8 0red 8143 . . . . . . . 8 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> 0 e. RR )
94rexrd 8192 . . . . . . . 8 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. RR* )
10 elico2 10129 . . . . . . . 8 |- ( ( 0 e. RR /\ M e. RR* ) -> ( A e. ( 0 [,) M ) <-> ( A e. RR /\ 0 <_ A /\ A < M ) ) )
118, 9, 10syl2anc 411 . . . . . . 7 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( A e. ( 0 [,) M ) <-> ( A e. RR /\ 0 <_ A /\ A < M ) ) )
127, 11mpbid 147 . . . . . 6 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( A e. RR /\ 0 <_ A /\ A < M ) )
1312simp1d 1033 . . . . 5 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. RR )
1413recnd 8171 . . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. CC )
156, 14addcomd 8293 . . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( N x. M ) + A ) = ( A + ( N x. M ) ) )
1615oveq1d 6015 . 2 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( ( N x. M ) + A ) mod M ) = ( ( A + ( N x. M ) ) mod M ) )
17 simprl 529 . . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. QQ )
18 simplr 528 . . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. QQ )
1912simp2d 1034 . . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> 0 <_ A )
2012simp3d 1035 . . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A < M )
218, 13, 4, 19, 20lelttrd 8267 . . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> 0 < M )
22 modqcyc 10576 . . 3 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A + ( N x. M ) ) mod M ) = ( A mod M ) )
2317, 1, 18, 21, 22syl22anc 1272 . 2 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( A + ( N x. M ) ) mod M ) = ( A mod M ) )
24 modqid 10566 . . 3 |- ( ( ( A e. QQ /\ M e. QQ ) /\ ( 0 <_ A /\ A < M ) ) -> ( A mod M ) = A )
2517, 18, 19, 20, 24syl22anc 1272 . 2 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( A mod M ) = A )
2616, 23, 253eqtrd 2266 1 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( ( N x. M ) + A ) mod M ) = A )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   e. wcel 2200   class class class wbr 4082  (class class class)co 6000   RRcr 7994   0cc0 7995   + caddc 7998   x. cmul 8000   RR*cxr 8176   < clt 8177   <_ cle 8178   ZZcz 9442   QQcq 9810   [,)cico 10082   mod cmo 10539
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 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113  ax-arch 8114
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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-po 4386  df-iso 4387  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-n0 9366  df-z 9443  df-q 9811  df-rp 9846  df-ico 10086  df-fl 10485  df-mod 10540
This theorem is referenced by:  modqmuladd  10583  addmodid  10589
  Copyright terms: Public domain W3C validator