Theorem modqmulmodr 10827

Description: The product of an integer and a rational number modulo a modulus equals the product of the integer and the rational number modulo the modulus. (Contributed by Jim Kingdon, 26-Oct-2021.)

Assertion

Ref	Expression
modqmulmodr	|- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A x. ( B mod M ) ) mod M ) = ( ( A x. B ) mod M ) )

Proof of Theorem modqmulmodr

Step	Hyp	Ref	Expression
1		simpll 531	. . . . 5 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> A e. ZZ )
2	1	zcnd 9769	. . . 4 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> A e. CC )
3		simplr 533	. . . . . 6 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> B e. QQ )
4		simprl 535	. . . . . 6 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> M e. QQ )
5		simprr 537	. . . . . 6 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 < M )
6	3, 4, 5	modqcld 10765	. . . . 5 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( B mod M ) e. QQ )
7		qcn 10034	. . . . 5 |- ( ( B mod M ) e. QQ -> ( B mod M ) e. CC )
8	6, 7	syl 14	. . . 4 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( B mod M ) e. CC )
9	2, 8	mulcomd 8347	. . 3 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A x. ( B mod M ) ) = ( ( B mod M ) x. A ) )
10	9	oveq1d 6100	. 2 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A x. ( B mod M ) ) mod M ) = ( ( ( B mod M ) x. A ) mod M ) )
11		modqmulmod 10826	. . 3 |- ( ( ( B e. QQ /\ A e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B mod M ) x. A ) mod M ) = ( ( B x. A ) mod M ) )
12	11	ancom1s 575	. 2 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( B mod M ) x. A ) mod M ) = ( ( B x. A ) mod M ) )
13		qcn 10034	. . . . 5 |- ( B e. QQ -> B e. CC )
14	3, 13	syl 14	. . . 4 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> B e. CC )
15	14, 2	mulcomd 8347	. . 3 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( B x. A ) = ( A x. B ) )
16	15	oveq1d 6100	. 2 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( B x. A ) mod M ) = ( ( A x. B ) mod M ) )
17	10, 12, 16	3eqtrd 2275	1 |- ( ( ( A e. ZZ /\ B e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A x. ( B mod M ) ) mod M ) = ( ( A x. B ) mod M ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   0cc0 8179   x. cmul 8184   < clt 8360   ZZcz 9644   QQcq 10019   mod cmo 10759

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-q 10020  df-rp 10055  df-fl 10705  df-mod 10760

This theorem is used by:  gausslemma2dlem6  16186