Theorem muldvds2 12584

Description: If a product divides an integer, so does one of its factors. (Contributed by Paul Chapman, 21-Mar-2011.)

Assertion

Ref	Expression
muldvds2	|- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( K x. M ) || N -> M || N ) )

Proof of Theorem muldvds2

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		zmulcl 9698	. . . 4 |- ( ( K e. ZZ /\ M e. ZZ ) -> ( K x. M ) e. ZZ )
2	1	anim1i 340	. . 3 |- ( ( ( K e. ZZ /\ M e. ZZ ) /\ N e. ZZ ) -> ( ( K x. M ) e. ZZ /\ N e. ZZ ) )
3	2	3impa 1225	. 2 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( K x. M ) e. ZZ /\ N e. ZZ ) )
4		3simpc 1027	. 2 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( M e. ZZ /\ N e. ZZ ) )
5		zmulcl 9698	. . . 4 |- ( ( x e. ZZ /\ K e. ZZ ) -> ( x x. K ) e. ZZ )
6	5	ancoms 268	. . 3 |- ( ( K e. ZZ /\ x e. ZZ ) -> ( x x. K ) e. ZZ )
7	6	3ad2antl1 1190	. 2 |- ( ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> ( x x. K ) e. ZZ )
8		zcn 9649	. . . . . . . 8 |- ( x e. ZZ -> x e. CC )
9		zcn 9649	. . . . . . . 8 |- ( K e. ZZ -> K e. CC )
10		zcn 9649	. . . . . . . 8 |- ( M e. ZZ -> M e. CC )
11		mulass 8310	. . . . . . . 8 |- ( ( x e. CC /\ K e. CC /\ M e. CC ) -> ( ( x x. K ) x. M ) = ( x x. ( K x. M ) ) )
12	8, 9, 10, 11	syl3an 1320	. . . . . . 7 |- ( ( x e. ZZ /\ K e. ZZ /\ M e. ZZ ) -> ( ( x x. K ) x. M ) = ( x x. ( K x. M ) ) )
13	12	3coml 1241	. . . . . 6 |- ( ( K e. ZZ /\ M e. ZZ /\ x e. ZZ ) -> ( ( x x. K ) x. M ) = ( x x. ( K x. M ) ) )
14	13	3expa 1234	. . . . 5 |- ( ( ( K e. ZZ /\ M e. ZZ ) /\ x e. ZZ ) -> ( ( x x. K ) x. M ) = ( x x. ( K x. M ) ) )
15	14	3adantl3 1186	. . . 4 |- ( ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> ( ( x x. K ) x. M ) = ( x x. ( K x. M ) ) )
16	15	eqeq1d 2247	. . 3 |- ( ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> ( ( ( x x. K ) x. M ) = N <-> ( x x. ( K x. M ) ) = N ) )
17	16	biimprd 158	. 2 |- ( ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> ( ( x x. ( K x. M ) ) = N -> ( ( x x. K ) x. M ) = N ) )
18	3, 4, 7, 17	dvds1lem 12569	1 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( K x. M ) || N -> M || N ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   x. cmul 8184   ZZcz 9644   || cdvds 12554

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-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-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  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-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-dvds 12555

This theorem is used by: (None)