Theorem mulmoddvds 11836

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 998	. . . . . . 7 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> A e. ZZ )
2		zq 9599	. . . . . . 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 999	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> B e. ZZ )
5		simp1 997	. . . . . . 7 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> N e. NN )
6		nnq 9606	. . . . . . 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 8936	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> 0 < N )
9		modqmulmod 10359	. . . . . 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 1239	. . . . 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 2181	. . . 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 11766	. . . . . . . 8 |- ( ( N e. NN /\ A e. ZZ ) -> ( N || A <-> ( A mod N ) = 0 ) )
14	13	3adant3 1017	. . . . . . 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 5880	. . . . 5 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( A mod N ) x. B ) = ( 0 x. B ) )
17	16	oveq1d 5880	. . . 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 9349	. . . . . . 7 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> B e. CC )
20	19	mul02d 8323	. . . . . 6 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( 0 x. B ) = 0 )
21	20	oveq1d 5880	. . . . 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 10325	. . . . . 6 |- ( ( N e. QQ /\ 0 < N ) -> ( 0 mod N ) = 0 )
25	22, 23, 24	syl2anc 411	. . . . 5 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( 0 mod N ) = 0 )
26	21, 25	eqtrd 2208	. . . 4 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( 0 x. B ) mod N ) = 0 )
27	17, 26	eqtrd 2208	. . 3 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( ( A mod N ) x. B ) mod N ) = 0 )
28	12, 27	eqtrd 2208	. 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 978   = wceq 1353   e. wcel 2146   class class class wbr 3998  (class class class)co 5865   0cc0 7786   x. cmul 7791   < clt 7966   NNcn 8892   ZZcz 9226   QQcq 9592   mod cmo 10292   || cdvds 11762

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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-mulrcl 7885  ax-addcom 7886  ax-mulcom 7887  ax-addass 7888  ax-mulass 7889  ax-distr 7890  ax-i2m1 7891  ax-0lt1 7892  ax-1rid 7893  ax-0id 7894  ax-rnegex 7895  ax-precex 7896  ax-cnre 7897  ax-pre-ltirr 7898  ax-pre-ltwlin 7899  ax-pre-lttrn 7900  ax-pre-apti 7901  ax-pre-ltadd 7902  ax-pre-mulgt0 7903  ax-pre-mulext 7904  ax-arch 7905

This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-po 4290  df-iso 4291  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-1st 6131  df-2nd 6132  df-pnf 7968  df-mnf 7969  df-xr 7970  df-ltxr 7971  df-le 7972  df-sub 8104  df-neg 8105  df-reap 8506  df-ap 8513  df-div 8603  df-inn 8893  df-n0 9150  df-z 9227  df-q 9593  df-rp 9625  df-fl 10240  df-mod 10293  df-dvds 11763

This theorem is referenced by: (None)