Theorem modqdi 10626

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 1045	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A e. QQ )
2		qcn 9841	. . . . 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 1022	. . . . 5 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> B e. QQ )
5		qcn 9841	. . . . 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 1049	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C e. QQ )
8		simp3r 1050	. . . . . . . . . 10 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < C )
9	8	gt0ne0d 8670	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C =/= 0 )
10		qdivcl 9850	. . . . . . . . 9 |- ( ( B e. QQ /\ C e. QQ /\ C =/= 0 ) -> ( B / C ) e. QQ )
11	4, 7, 9, 10	syl3anc 1271	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( B / C ) e. QQ )
12	11	flqcld 10509	. . . . . . 7 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. ZZ )
13		zq 9833	. . . . . . 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 9844	. . . . . 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 9841	. . . . 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 8571	. . 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 9841	. . . . . . . . 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 9832	. . . . . . . . . 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 8787	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> C # 0 )
25		qre 9832	. . . . . . . . . 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 1046	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < A )
28	26, 27	gt0ap0d 8787	. . . . . . . 8 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> A # 0 )
29	6, 21, 3, 24, 28	divcanap5d 8975	. . . . . . 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 5633	. . . . . 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 6023	. . . . 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 9581	. . . . . 6 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> ( |_ ` ( B / C ) ) e. CC )
33	3, 21, 32	mulassd 8181	. . . . 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 2263	. . . 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 6023	. . 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 2262	. 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 10558	. . . 4 |- ( ( B e. QQ /\ C e. QQ /\ 0 < C ) -> ( B mod C ) = ( B - ( C x. ( |_ ` ( B / C ) ) ) ) )
38	4, 7, 8, 37	syl3anc 1271	. . 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 6023	. 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 9844	. . . 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 9844	. . . 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 8280	. . 3 |- ( ( ( A e. QQ /\ 0 < A ) /\ B e. QQ /\ ( C e. QQ /\ 0 < C ) ) -> 0 < ( A x. C ) )
45		modqval 10558	. . 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 1271	. 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 2272	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 1002   = wceq 1395   e. wcel 2200   =/= wne 2400   class class class wbr 4083   ` cfv 5318  (class class class)co 6007   CCcc 8008   RRcr 8009   0cc0 8010   x. cmul 8015   < clt 8192   - cmin 8328   / cdiv 8830   ZZcz 9457   QQcq 9826   |_cfl 10500   mod cmo 10556

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 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128  ax-arch 8129

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 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831  df-inn 9122  df-n0 9381  df-z 9458  df-q 9827  df-rp 9862  df-fl 10502  df-mod 10557

This theorem is referenced by: (None)