Theorem mulmoddvds 12613

Description: If an integer is divisible by a positive integer, the product of this integer with another integer modulo the positive integer is 0. (Contributed by Alexander van der Vekens, 30-Aug-2018.)

Assertion

Ref	Expression
mulmoddvds	|- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> ( N || A -> ( ( A x. B ) mod N ) = 0 ) )

Proof of Theorem mulmoddvds

Step	Hyp	Ref	Expression
1		simp2 1029	. . . . . . 7 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> A e. ZZ )
2		zq 10009	. . . . . . 7 |- ( A e. ZZ -> A e. QQ )
3	1, 2	syl 14	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> A e. QQ )
4		simp3 1030	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> B e. ZZ )
5		simp1 1028	. . . . . . 7 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> N e. NN )
6		nnq 10016	. . . . . . 7 |- ( N e. NN -> N e. QQ )
7	5, 6	syl 14	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> N e. QQ )
8	5	nngt0d 9331	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> 0 < N )
9		modqmulmod 10809	. . . . . 6 |- ( ( ( A e. QQ /\ B e. ZZ ) /\ ( N e. QQ /\ 0 < N ) ) -> ( ( ( A mod N ) x. B ) mod N ) = ( ( A x. B ) mod N ) )
10	3, 4, 7, 8, 9	syl22anc 1279	. . . . 5 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> ( ( ( A mod N ) x. B ) mod N ) = ( ( A x. B ) mod N ) )
11	10	eqcomd 2244	. . . 4 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> ( ( A x. B ) mod N ) = ( ( ( A mod N ) x. B ) mod N ) )
12	11	adantr 276	. . 3 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( A x. B ) mod N ) = ( ( ( A mod N ) x. B ) mod N ) )
13		dvdsval3 12541	. . . . . . . 8 |- ( ( N e. NN /\ A e. ZZ ) -> ( N || A <-> ( A mod N ) = 0 ) )
14	13	3adant3 1048	. . . . . . 7 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> ( N || A <-> ( A mod N ) = 0 ) )
15	14	biimpa 296	. . . . . 6 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( A mod N ) = 0 )
16	15	oveq1d 6094	. . . . 5 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( A mod N ) x. B ) = ( 0 x. B ) )
17	16	oveq1d 6094	. . . 4 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( ( A mod N ) x. B ) mod N ) = ( ( 0 x. B ) mod N ) )
18	4	adantr 276	. . . . . . . 8 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> B e. ZZ )
19	18	zcnd 9752	. . . . . . 7 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> B e. CC )
20	19	mul02d 8713	. . . . . 6 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( 0 x. B ) = 0 )
21	20	oveq1d 6094	. . . . 5 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( 0 x. B ) mod N ) = ( 0 mod N ) )
22	7	adantr 276	. . . . . 6 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> N e. QQ )
23	8	adantr 276	. . . . . 6 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> 0 < N )
24		q0mod 10775	. . . . . 6 |- ( ( N e. QQ /\ 0 < N ) -> ( 0 mod N ) = 0 )
25	22, 23, 24	syl2anc 415	. . . . 5 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( 0 mod N ) = 0 )
26	21, 25	eqtrd 2271	. . . 4 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( 0 x. B ) mod N ) = 0 )
27	17, 26	eqtrd 2271	. . 3 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( ( A mod N ) x. B ) mod N ) = 0 )
28	12, 27	eqtrd 2271	. 2 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( A x. B ) mod N ) = 0 )
29	28	ex 115	1 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> ( N || A -> ( ( A x. B ) mod N ) = 0 ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4128  (class class class)co 6079   0cc0 8173   x. cmul 8178   < clt 8354   NNcn 9287   ZZcz 9627   QQcq 10002   mod cmo 10742   || cdvds 12537

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 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 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-mulrcl 8272  ax-addcom 8273  ax-mulcom 8274  ax-addass 8275  ax-mulass 8276  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-1rid 8280  ax-0id 8281  ax-rnegex 8282  ax-precex 8283  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289  ax-pre-mulgt0 8290  ax-pre-mulext 8291  ax-arch 8292

This theorem 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 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-po 4439  df-iso 4440  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-reap 8897  df-ap 8904  df-div 8997  df-inn 9288  df-n0 9547  df-z 9628  df-q 10003  df-rp 10038  df-fl 10688  df-mod 10743  df-dvds 12538

This theorem is referenced by: (None)