ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  modqcyc2 Unicode version
Theorem modqcyc2 10582
Description: The modulo operation is periodic. (Contributed by Jim Kingdon, 21-Oct-2021.)
Assertion
Ref Expression
modqcyc2 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( ( A - ( B x. N ) ) mod B ) = ( A mod B ) )
Proof of Theorem modqcyc2
StepHypRef Expression
1 simplr 528 . . . . . . . 8 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> N e. ZZ )
21zcnd 9570 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> N e. CC )
3 qcn 9829 . . . . . . . 8 |- ( B e. QQ -> B e. CC )
43ad2antrl 490 . . . . . . 7 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> B e. CC )
52, 4mulneg1d 8557 . . . . . 6 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( -u N x. B ) = -u ( N x. B ) )
6 mulcom 8128 . . . . . . . 8 |- ( ( B e. CC /\ N e. CC ) -> ( B x. N ) = ( N x. B ) )
76negeqd 8341 . . . . . . 7 |- ( ( B e. CC /\ N e. CC ) -> -u ( B x. N ) = -u ( N x. B ) )
84, 2, 7syl2anc 411 . . . . . 6 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> -u ( B x. N ) = -u ( N x. B ) )
95, 8eqtr4d 2265 . . . . 5 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( -u N x. B ) = -u ( B x. N ) )
109oveq2d 6017 . . . 4 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( A + ( -u N x. B ) ) = ( A + -u ( B x. N ) ) )
11 qcn 9829 . . . . . 6 |- ( A e. QQ -> A e. CC )
1211ad2antrr 488 . . . . 5 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> A e. CC )
134, 2mulcld 8167 . . . . 5 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( B x. N ) e. CC )
1412, 13negsubd 8463 . . . 4 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( A + -u ( B x. N ) ) = ( A - ( B x. N ) ) )
1510, 14eqtr2d 2263 . . 3 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( A - ( B x. N ) ) = ( A + ( -u N x. B ) ) )
1615oveq1d 6016 . 2 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( ( A - ( B x. N ) ) mod B ) = ( ( A + ( -u N x. B ) ) mod B ) )
17 znegcl 9477 . . 3 |- ( N e. ZZ -> -u N e. ZZ )
18 modqcyc 10581 . . 3 |- ( ( ( A e. QQ /\ -u N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( ( A + ( -u N x. B ) ) mod B ) = ( A mod B ) )
1917, 18sylanl2 403 . 2 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( ( A + ( -u N x. B ) ) mod B ) = ( A mod B ) )
2016, 19eqtrd 2262 1 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( B e. QQ /\ 0 < B ) ) -> ( ( A - ( B x. N ) ) mod B ) = ( A mod B ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200   class class class wbr 4083  (class class class)co 6001   CCcc 7997   0cc0 7999   + caddc 8002   x. cmul 8004   < clt 8181   - cmin 8317   -ucneg 8318   ZZcz 9446   QQcq 9814   mod cmo 10544
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 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117  ax-arch 8118
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 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-n0 9370  df-z 9447  df-q 9815  df-rp 9850  df-fl 10490  df-mod 10545
This theorem is referenced by:  modqadd1  10583  modqmul1  10599  q2submod  10607  modqsubdir  10615
  Copyright terms: Public domain W3C validator