Theorem modqmul12d 10815

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 10026	. . . 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 10026	. . . 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 10814	. 2 |- ( ph -> ( ( A x. C ) mod E ) = ( ( B x. C ) mod E ) )
12	4	zcnd 9769	. . . . 5 |- ( ph -> B e. CC )
13	7	zcnd 9769	. . . . 5 |- ( ph -> C e. CC )
14	12, 13	mulcomd 8347	. . . 4 |- ( ph -> ( B x. C ) = ( C x. B ) )
15	14	oveq1d 6100	. . 3 |- ( ph -> ( ( B x. C ) mod E ) = ( ( C x. B ) mod E ) )
16		zq 10026	. . . . 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 10026	. . . . 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 10814	. . 3 |- ( ph -> ( ( C x. B ) mod E ) = ( ( D x. B ) mod E ) )
23	18	zcnd 9769	. . . . 5 |- ( ph -> D e. CC )
24	23, 12	mulcomd 8347	. . . 4 |- ( ph -> ( D x. B ) = ( B x. D ) )
25	24	oveq1d 6100	. . 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 4130  (class class class)co 6085   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:  modqexp  11104  fprodmodd  12408  modxai  13195  lgsdir2lem5  16151  lgseisenlem2  16190  lgseisenlem3  16191