Theorem mulmoddvds 12632

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 10028	. . . . . . 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 10035	. . . . . . 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 9349	. . . . . 6 |- ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) -> 0 < N )
9		modqmulmod 10828	. . . . . 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 12560	. . . . . . . 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 6100	. . . . 5 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( ( A mod N ) x. B ) = ( 0 x. B ) )
17	16	oveq1d 6100	. . . 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 9771	. . . . . . 7 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> B e. CC )
20	19	mul02d 8719	. . . . . 6 |- ( ( ( N e. NN /\ A e. ZZ /\ B e. ZZ ) /\ N || A ) -> ( 0 x. B ) = 0 )
21	20	oveq1d 6100	. . . . 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 10794	. . . . . 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 ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   0cc0 8179   x. cmul 8184   < clt 8360   NNcn 9305   ZZcz 9646   QQcq 10021   mod cmo 10761   || cdvds 12556

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 8904  df-ap 8911  df-div 9004  df-inn 9306  df-n0 9566  df-z 9647  df-q 10022  df-rp 10057  df-fl 10707  df-mod 10762  df-dvds 12557

This theorem is used by: (None)