ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dvdscmulr Unicode version

Theorem dvdscmulr 12102
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 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 )
31, 2zmulcld 9500 . . . 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 )
51, 4zmulcld 9500 . . . 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 9495 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  K  e.  CC )
118zcnd 9495 . . . . . . 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 9495 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  M  e.  CC )
1410, 11, 13mul12d 8223 . . . . . 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 2213 . . . . 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 8092 . . . . . 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 9495 . . . . . 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 9382 . . . . . . . 8  |-  0  e.  ZZ
21 zapne 9446 . . . . . . . 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 8733 . . . . 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 12084 . 2  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  -> 
( ( K  x.  M )  ||  ( K  x.  N )  ->  M  ||  N ) )
28 dvdscmul 12100 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  ->  ( M  ||  N  ->  ( K  x.  M )  ||  ( K  x.  N
) ) )
29283adant3r 1237 . 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 980    = wceq 1372    e. wcel 2175    =/= wne 2375   class class class wbr 4043  (class class class)co 5943   0cc0 7924    x. cmul 7929   # cap 8653   ZZcz 9371    || cdvds 12069
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-mulrcl 8023  ax-addcom 8024  ax-mulcom 8025  ax-addass 8026  ax-mulass 8027  ax-distr 8028  ax-i2m1 8029  ax-0lt1 8030  ax-1rid 8031  ax-0id 8032  ax-rnegex 8033  ax-precex 8034  ax-cnre 8035  ax-pre-ltirr 8036  ax-pre-ltwlin 8037  ax-pre-lttrn 8038  ax-pre-apti 8039  ax-pre-ltadd 8040  ax-pre-mulgt0 8041  ax-pre-mulext 8042
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-br 4044  df-opab 4105  df-id 4339  df-po 4342  df-iso 4343  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-iota 5231  df-fun 5272  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-pnf 8108  df-mnf 8109  df-xr 8110  df-ltxr 8111  df-le 8112  df-sub 8244  df-neg 8245  df-reap 8647  df-ap 8654  df-inn 9036  df-n0 9295  df-z 9372  df-dvds 12070
This theorem is referenced by:  modmulconst  12105  bitsmod  12238  mulgcd  12308  oddpwdclemxy  12462  oddpwdclemodd  12465  pcpremul  12587  4sqlem17  12701  znrrg  14393
  Copyright terms: Public domain W3C validator