Theorem dvdscmulr 12399

Description: Cancellation law for the divides relation. Theorem 1.1(e) in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.)

Assertion

Ref	Expression
dvdscmulr	|- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) <-> M || N ) )

Proof of Theorem dvdscmulr

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp3l 1051	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> K e. ZZ )
2		simp1 1023	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> M e. ZZ )
3	1, 2	zmulcld 9608	. . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( K x. M ) e. ZZ )
4		simp2 1024	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> N e. ZZ )
5	1, 4	zmulcld 9608	. . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( K x. N ) e. ZZ )
6	3, 5	jca 306	. . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) e. ZZ /\ ( K x. N ) e. ZZ ) )
7	2, 4	jca 306	. . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( M e. ZZ /\ N e. ZZ ) )
8		simpr 110	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> x e. ZZ )
9	1	adantr 276	. . . . . . . 8 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K e. ZZ )
10	9	zcnd 9603	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K e. CC )
11	8	zcnd 9603	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> x e. CC )
12	2	adantr 276	. . . . . . . 8 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> M e. ZZ )
13	12	zcnd 9603	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> M e. CC )
14	10, 11, 13	mul12d 8331	. . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( K x. ( x x. M ) ) = ( x x. ( K x. M ) ) )
15	14	eqeq1d 2240	. . . . 5 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( ( K x. ( x x. M ) ) = ( K x. N ) <-> ( x x. ( K x. M ) ) = ( K x. N ) ) )
16	11, 13	mulcld 8200	. . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( x x. M ) e. CC )
17	4	adantr 276	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> N e. ZZ )
18	17	zcnd 9603	. . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> N e. CC )
19		simpl3r 1079	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K =/= 0 )
20		0z 9490	. . . . . . . 8 |- 0 e. ZZ
21		zapne 9554	. . . . . . . 8 |- ( ( K e. ZZ /\ 0 e. ZZ ) -> ( K # 0 <-> K =/= 0 ) )
22	9, 20, 21	sylancl 413	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( K # 0 <-> K =/= 0 ) )
23	19, 22	mpbird 167	. . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K # 0 )
24	16, 18, 10, 23	mulcanapd 8841	. . . . 5 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( ( K x. ( x x. M ) ) = ( K x. N ) <-> ( x x. M ) = N ) )
25	15, 24	bitr3d 190	. . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( ( x x. ( K x. M ) ) = ( K x. N ) <-> ( x x. M ) = N ) )
26	25	biimpd 144	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( ( x x. ( K x. M ) ) = ( K x. N ) -> ( x x. M ) = N ) )
27	6, 7, 8, 26	dvds1lem 12381	. 2 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) -> M || N ) )
28		dvdscmul 12397	. . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ K e. ZZ ) -> ( M || N -> ( K x. M ) || ( K x. N ) ) )
29	28	3adant3r 1261	. 2 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( M || N -> ( K x. M ) || ( K x. N ) ) )
30	27, 29	impbid 129	1 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) <-> M || N ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1004   = wceq 1397   e. wcel 2202   =/= wne 2402   class class class wbr 4088  (class class class)co 6018   0cc0 8032   x. cmul 8037   # cap 8761   ZZcz 9479   || cdvds 12366

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-inn 9144  df-n0 9403  df-z 9480  df-dvds 12367

This theorem is referenced by:  modmulconst  12402  bitsmod  12535  mulgcd  12605  oddpwdclemxy  12759  oddpwdclemodd  12762  pcpremul  12884  4sqlem17  12998  znrrg  14693