Theorem dvdscmulr 12002

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 1027	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> K e. ZZ )
2		simp1 999	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> M e. ZZ )
3	1, 2	zmulcld 9471	. . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( K x. M ) e. ZZ )
4		simp2 1000	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> N e. ZZ )
5	1, 4	zmulcld 9471	. . . 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 9466	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K e. CC )
11	8	zcnd 9466	. . . . . . 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 9466	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> M e. CC )
14	10, 11, 13	mul12d 8195	. . . . . 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 2205	. . . . 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 8064	. . . . . 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 9466	. . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> N e. CC )
19		simpl3r 1055	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K =/= 0 )
20		0z 9354	. . . . . . . 8 |- 0 e. ZZ
21		zapne 9417	. . . . . . . 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 8705	. . . . 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 11984	. 2 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) -> M || N ) )
28		dvdscmul 12000	. . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ K e. ZZ ) -> ( M || N -> ( K x. M ) || ( K x. N ) ) )
29	28	3adant3r 1237	. 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 980   = wceq 1364   e. wcel 2167   =/= wne 2367   class class class wbr 4034  (class class class)co 5925   0cc0 7896   x. cmul 7901   # cap 8625   ZZcz 9343   || cdvds 11969

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-mulrcl 7995  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-mulass 7999  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-1rid 8003  ax-0id 8004  ax-rnegex 8005  ax-precex 8006  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012  ax-pre-mulgt0 8013  ax-pre-mulext 8014

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-id 4329  df-po 4332  df-iso 4333  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-reap 8619  df-ap 8626  df-inn 9008  df-n0 9267  df-z 9344  df-dvds 11970

This theorem is referenced by:  modmulconst  12005  bitsmod  12138  mulgcd  12208  oddpwdclemxy  12362  oddpwdclemodd  12365  pcpremul  12487  4sqlem17  12601  znrrg  14292