Theorem modqdi 10463

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 1023	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A e. QQ )
2		qcn 9699	. . . . 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 1000	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> B e. QQ )
5		qcn 9699	. . . . 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 1027	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C e. QQ )
8		simp3r 1028	. . . . . . . . . 10 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < C )
9	8	gt0ne0d 8531	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C =/= 0 )
10		qdivcl 9708	. . . . . . . . 9 |- ( ( B e. QQ /\ C e. QQ /\ C =/= 0 ) -> ( B / C ) e. QQ )
11	4, 7, 9, 10	syl3anc 1249	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( B / C ) e. QQ )
12	11	flqcld 10346	. . . . . . 7 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. ZZ )
13		zq 9691	. . . . . . 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 9702	. . . . . 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 9699	. . . . 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 8433	. . 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 9699	. . . . . . . . 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 9690	. . . . . . . . . 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 8648	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C # 0 )
25		qre 9690	. . . . . . . . . 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 1024	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < A )
28	26, 27	gt0ap0d 8648	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A # 0 )
29	6, 21, 3, 24, 28	divcanap5d 8836	. . . . . . 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 5558	. . . . . 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 5934	. . . . 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 9440	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. CC )
33	3, 21, 32	mulassd 8043	. . . . 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 2227	. . . 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 5934	. . 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 2226	. 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 10395	. . . 4 |- ( ( B e. QQ /\ C e. QQ /\ 0 < C ) -> ( B mod C ) = ( B - ( C x. ( |_ ` ( B / C ) ) ) ) )
38	4, 7, 8, 37	syl3anc 1249	. . 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 5934	. 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 9702	. . . 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 9702	. . . 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 8142	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < ( A x. C ) )
45		modqval 10395	. . 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 1249	. 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 2236	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 980   = wceq 1364   e. wcel 2164   =/= wne 2364   class class class wbr 4029   ` cfv 5254  (class class class)co 5918   CCcc 7870   RRcr 7871   0cc0 7872   x. cmul 7877   < clt 8054   - cmin 8190   / cdiv 8691   ZZcz 9317   QQcq 9684   |_cfl 10337   mod cmo 10393

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990  ax-arch 7991

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-po 4327  df-iso 4328  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-n0 9241  df-z 9318  df-q 9685  df-rp 9720  df-fl 10339  df-mod 10394

This theorem is referenced by: (None)