Theorem modqdi 10655

Description: Distribute multiplication over a modulo operation. (Contributed by Jim Kingdon, 26-Oct-2021.)

Assertion

Ref	Expression
modqdi	|- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. ( B mod C ) ) = ( ( A x. B ) mod ( A x. C ) ) )

Proof of Theorem modqdi

Step	Hyp	Ref	Expression
1		simp1l 1047	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A e. QQ )
2		qcn 9868	. . . . 5 |- ( A e. QQ -> A e. CC )
3	1, 2	syl 14	. . . 4 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A e. CC )
4		simp2 1024	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> B e. QQ )
5		qcn 9868	. . . . 5 |- ( B e. QQ -> B e. CC )
6	4, 5	syl 14	. . . 4 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> B e. CC )
7		simp3l 1051	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C e. QQ )
8		simp3r 1052	. . . . . . . . . 10 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < C )
9	8	gt0ne0d 8692	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C =/= 0 )
10		qdivcl 9877	. . . . . . . . 9 |- ( ( B e. QQ /\ C e. QQ /\ C =/= 0 ) -> ( B / C ) e. QQ )
11	4, 7, 9, 10	syl3anc 1273	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( B / C ) e. QQ )
12	11	flqcld 10538	. . . . . . 7 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. ZZ )
13		zq 9860	. . . . . . 7 |- ( ( |_ ` ( B / C ) ) e. ZZ -> ( |_ ` ( B / C ) ) e. QQ )
14	12, 13	syl 14	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. QQ )
15		qmulcl 9871	. . . . . 6 |- ( ( C e. QQ /\ ( |_ ` ( B / C ) ) e. QQ ) -> ( C x. ( |_ ` ( B / C ) ) ) e. QQ )
16	7, 14, 15	syl2anc 411	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( C x. ( |_ ` ( B / C ) ) ) e. QQ )
17		qcn 9868	. . . . 5 |- ( ( C x. ( |_ ` ( B / C ) ) ) e. QQ -> ( C x. ( |_ ` ( B / C ) ) ) e. CC )
18	16, 17	syl 14	. . . 4 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( C x. ( |_ ` ( B / C ) ) ) e. CC )
19	3, 6, 18	subdid 8593	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. ( B - ( C x. ( |_ ` ( B / C ) ) ) ) ) = ( ( A x. B ) - ( A x. ( C x. ( |_ ` ( B / C ) ) ) ) ) )
20		qcn 9868	. . . . . . . . 9 |- ( C e. QQ -> C e. CC )
21	7, 20	syl 14	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C e. CC )
22		qre 9859	. . . . . . . . . 10 |- ( C e. QQ -> C e. RR )
23	7, 22	syl 14	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C e. RR )
24	23, 8	gt0ap0d 8809	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C # 0 )
25		qre 9859	. . . . . . . . . 10 |- ( A e. QQ -> A e. RR )
26	1, 25	syl 14	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A e. RR )
27		simp1r 1048	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < A )
28	26, 27	gt0ap0d 8809	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A # 0 )
29	6, 21, 3, 24, 28	divcanap5d 8997	. . . . . . 7 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( ( A x. B ) / ( A x. C ) ) = ( B / C ) )
30	29	fveq2d 5643	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) = ( |_ ` ( B / C ) ) )
31	30	oveq2d 6034	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( ( A x. C ) x. ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) ) = ( ( A x. C ) x. ( |_ ` ( B / C ) ) ) )
32	12	zcnd 9603	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. CC )
33	3, 21, 32	mulassd 8203	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( ( A x. C ) x. ( |_ ` ( B / C ) ) ) = ( A x. ( C x. ( |_ ` ( B / C ) ) ) ) )
34	31, 33	eqtr2d 2265	. . . 4 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. ( C x. ( |_ ` ( B / C ) ) ) ) = ( ( A x. C ) x. ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) ) )
35	34	oveq2d 6034	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( ( A x. B ) - ( A x. ( C x. ( |_ ` ( B / C ) ) ) ) ) = ( ( A x. B ) - ( ( A x. C ) x. ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) ) ) )
36	19, 35	eqtrd 2264	. 2 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. ( B - ( C x. ( |_ ` ( B / C ) ) ) ) ) = ( ( A x. B ) - ( ( A x. C ) x. ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) ) ) )
37		modqval 10587	. . . 4 |- ( ( B e. QQ /\ C e. QQ /\ 0 < C ) -> ( B mod C ) = ( B - ( C x. ( |_ ` ( B / C ) ) ) ) )
38	4, 7, 8, 37	syl3anc 1273	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( B mod C ) = ( B - ( C x. ( |_ ` ( B / C ) ) ) ) )
39	38	oveq2d 6034	. 2 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. ( B mod C ) ) = ( A x. ( B - ( C x. ( |_ ` ( B / C ) ) ) ) ) )
40		qmulcl 9871	. . . 4 |- ( ( A e. QQ /\ B e. QQ ) -> ( A x. B ) e. QQ )
41	1, 4, 40	syl2anc 411	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. B ) e. QQ )
42		qmulcl 9871	. . . 4 |- ( ( A e. QQ /\ C e. QQ ) -> ( A x. C ) e. QQ )
43	1, 7, 42	syl2anc 411	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. C ) e. QQ )
44	26, 23, 27, 8	mulgt0d 8302	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < ( A x. C ) )
45		modqval 10587	. . 3 |- ( ( ( A x. B ) e. QQ /\ ( A x. C ) e. QQ /\ 0 < ( A x. C ) ) -> ( ( A x. B ) mod ( A x. C ) ) = ( ( A x. B ) - ( ( A x. C ) x. ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) ) ) )
46	41, 43, 44, 45	syl3anc 1273	. 2 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( ( A x. B ) mod ( A x. C ) ) = ( ( A x. B ) - ( ( A x. C ) x. ( |_ ` ( ( A x. B ) / ( A x. C ) ) ) ) ) )
47	36, 39, 46	3eqtr4d 2274	1 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( A x. ( B mod C ) ) = ( ( A x. B ) mod ( A x. C ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   =/= wne 2402   class class class wbr 4088   ` cfv 5326  (class class class)co 6018   CCcc 8030   RRcr 8031   0cc0 8032   x. cmul 8037   < clt 8214   - cmin 8350   / cdiv 8852   ZZcz 9479   QQcq 9853   |_cfl 10529   mod cmo 10585

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150  ax-arch 8151

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-n0 9403  df-z 9480  df-q 9854  df-rp 9889  df-fl 10531  df-mod 10586

This theorem is referenced by: (None)