ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dvdscmulr Unicode version
Theorem dvdscmulr 11829
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.
StepHypRef Expression
1 simp3l 1025 . . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> K e. ZZ )
2 simp1 997 . . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> M e. ZZ )
31, 2zmulcld 9383 . . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( K x. M ) e. ZZ )
4 simp2 998 . . . . 5 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> N e. ZZ )
51, 4zmulcld 9383 . . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( K x. N ) e. ZZ )
63, 5jca 306 . . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) e. ZZ /\ ( K x. N ) e. ZZ ) )
72, 4jca 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 )
91adantr 276 . . . . . . . 8 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K e. ZZ )
109zcnd 9378 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K e. CC )
118zcnd 9378 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> x e. CC )
122adantr 276 . . . . . . . 8 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> M e. ZZ )
1312zcnd 9378 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> M e. CC )
1410, 11, 13mul12d 8111 . . . . . 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 ) ) )
1514eqeq1d 2186 . . . . 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 ) ) )
1611, 13mulcld 7980 . . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( x x. M ) e. CC )
174adantr 276 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> N e. ZZ )
1817zcnd 9378 . . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> N e. CC )
19 simpl3r 1053 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K =/= 0 )
20 0z 9266 . . . . . . . 8 |- 0 e. ZZ
21 zapne 9329 . . . . . . . 8 |- ( ( K e. ZZ /\ 0 e. ZZ ) -> ( K # 0 <-> K =/= 0 ) )
229, 20, 21sylancl 413 . . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> ( K # 0 <-> K =/= 0 ) )
2319, 22mpbird 167 . . . . . 6 |- ( ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) /\ x e. ZZ ) -> K # 0 )
2416, 18, 10, 23mulcanapd 8620 . . . . 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 ) )
2515, 24bitr3d 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 ) )
2625biimpd 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 ) )
276, 7, 8, 26dvds1lem 11811 . 2 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) -> M || N ) )
28 dvdscmul 11827 . . 3 |- ( ( M e. ZZ /\ N e. ZZ /\ K e. ZZ ) -> ( M || N -> ( K x. M ) || ( K x. N ) ) )
29283adant3r 1235 . 2 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( M || N -> ( K x. M ) || ( K x. N ) ) )
3027, 29impbid 129 1 |- ( ( M e. ZZ /\ N e. ZZ /\ ( K e. ZZ /\ K =/= 0 ) ) -> ( ( K x. M ) || ( K x. N ) <-> M || N ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 978   = wceq 1353   e. wcel 2148   =/= wne 2347   class class class wbr 4005  (class class class)co 5877   0cc0 7813   x. cmul 7818   # cap 8540   ZZcz 9255   || cdvds 11796
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-id 4295  df-po 4298  df-iso 4299  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-inn 8922  df-n0 9179  df-z 9256  df-dvds 11797
This theorem is referenced by:  modmulconst  11832  mulgcd  12019  oddpwdclemxy  12171  oddpwdclemodd  12174  pcpremul  12295
  Copyright terms: Public domain W3C validator