Theorem dvdscmulr 12506

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 1052	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> K e. ZZ )
2		simp1 1024	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> M e. ZZ )
3	1, 2	zmulcld 9706	. . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( K x. M ) e. ZZ )
4		simp2 1025	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> N e. ZZ )
5	1, 4	zmulcld 9706	. . . 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 9701	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K e. CC )
11	8	zcnd 9701	. . . . . . 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 9701	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> M e. CC )
14	10, 11, 13	mul12d 8425	. . . . . 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 2241	. . . . 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 8294	. . . . . 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 9701	. . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> N e. CC )
19		simpl3r 1080	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K =/= 0 )
20		0z 9588	. . . . . . . 8 |- 0 e. ZZ
21		zapne 9652	. . . . . . . 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 8935	. . . . 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 12488	. 2 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) -> M || N ) )
28		dvdscmul 12504	. . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ K e. ZZ ) -> ( M || N -> ( K x. M ) || ( K x. N ) ) )
29	28	3adant3r 1262	. 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 1005   = wceq 1398   e. wcel 2203   =/= wne 2412   class class class wbr 4109  (class class class)co 6050   0cc0 8127   x. cmul 8132   # cap 8855   ZZcz 9577   || cdvds 12473

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-inn 9238  df-n0 9497  df-z 9578  df-dvds 12474

This theorem is referenced by:  modmulconst  12509  bitsmod  12642  mulgcd  12712  oddpwdclemxy  12866  oddpwdclemodd  12869  pcpremul  12991  4sqlem17  13105  znrrg  14808