Theorem modqmul12d 10836

Description: Multiplication property of the modulo operation, see theorem 5.2(b) in [ApostolNT] p. 107. (Contributed by Jim Kingdon, 24-Oct-2021.)

Hypotheses

Ref	Expression
modqmul12d.1	|- ( ph -> A e. ZZ )
modqmul12d.2	|- ( ph -> B e. ZZ )
modqmul12d.3	|- ( ph -> C e. ZZ )
modqmul12d.4	|- ( ph -> D e. ZZ )
modqmul12d.5	|- ( ph -> E e. QQ )
modqmul12d.egt0	|- ( ph -> 0 < E )
modqmul12d.6	|- ( ph -> ( A mod E ) = ( B mod E ) )
modqmul12d.7	|- ( ph -> ( C mod E ) = ( D mod E ) )

Assertion

Ref	Expression
modqmul12d	|- ( ph -> ( ( A x. C ) mod E ) = ( ( B x. D ) mod E ) )

Proof of Theorem modqmul12d

Step	Hyp	Ref	Expression
1		modqmul12d.1	. . . 4 |- ( ph -> A e. ZZ )
2		zq 10042	. . . 4 |- ( A e. ZZ -> A e. QQ )
3	1, 2	syl 14	. . 3 |- ( ph -> A e. QQ )
4		modqmul12d.2	. . . 4 |- ( ph -> B e. ZZ )
5		zq 10042	. . . 4 |- ( B e. ZZ -> B e. QQ )
6	4, 5	syl 14	. . 3 |- ( ph -> B e. QQ )
7		modqmul12d.3	. . 3 |- ( ph -> C e. ZZ )
8		modqmul12d.5	. . 3 |- ( ph -> E e. QQ )
9		modqmul12d.egt0	. . 3 |- ( ph -> 0 < E )
10		modqmul12d.6	. . 3 |- ( ph -> ( A mod E ) = ( B mod E ) )
11	3, 6, 7, 8, 9, 10	modqmul1 10835	. 2 |- ( ph -> ( ( A x. C ) mod E ) = ( ( B x. C ) mod E ) )
12	4	zcnd 9780	. . . . 5 |- ( ph -> B e. CC )
13	7	zcnd 9780	. . . . 5 |- ( ph -> C e. CC )
14	12, 13	mulcomd 8353	. . . 4 |- ( ph -> ( B x. C ) = ( C x. B ) )
15	14	oveq1d 6103	. . 3 |- ( ph -> ( ( B x. C ) mod E ) = ( ( C x. B ) mod E ) )
16		zq 10042	. . . . 5 |- ( C e. ZZ -> C e. QQ )
17	7, 16	syl 14	. . . 4 |- ( ph -> C e. QQ )
18		modqmul12d.4	. . . . 5 |- ( ph -> D e. ZZ )
19		zq 10042	. . . . 5 |- ( D e. ZZ -> D e. QQ )
20	18, 19	syl 14	. . . 4 |- ( ph -> D e. QQ )
21		modqmul12d.7	. . . 4 |- ( ph -> ( C mod E ) = ( D mod E ) )
22	17, 20, 4, 8, 9, 21	modqmul1 10835	. . 3 |- ( ph -> ( ( C x. B ) mod E ) = ( ( D x. B ) mod E ) )
23	18	zcnd 9780	. . . . 5 |- ( ph -> D e. CC )
24	23, 12	mulcomd 8353	. . . 4 |- ( ph -> ( D x. B ) = ( B x. D ) )
25	24	oveq1d 6103	. . 3 |- ( ph -> ( ( D x. B ) mod E ) = ( ( B x. D ) mod E ) )
26	15, 22, 25	3eqtrd 2275	. 2 |- ( ph -> ( ( B x. C ) mod E ) = ( ( B x. D ) mod E ) )
27	11, 26	eqtrd 2271	1 |- ( ph -> ( ( A x. C ) mod E ) = ( ( B x. D ) mod E ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   class class class wbr 4131  (class class class)co 6088   0cc0 8185   x. cmul 8190   < clt 8366   ZZcz 9655   QQcq 10035   mod cmo 10780

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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304

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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-po 4443  df-iso 4444  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-n0 9575  df-z 9656  df-q 10036  df-rp 10072  df-fl 10722  df-mod 10781

This theorem is used by:  modqexp  11125  fprodmodd  12433  modxai  13224  lgsdir2lem5  16356  lgseisenlem2  16395  lgseisenlem3  16396