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

Theorem dvdscmulr 12565
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 1056 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  K  e.  ZZ )
2 simp1 1028 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  M  e.  ZZ )
31, 2zmulcld 9753 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  -> 
( K  x.  M
)  e.  ZZ )
4 simp2 1029 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  N  e.  ZZ )
51, 4zmulcld 9753 . . . 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 9748 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  K  e.  CC )
118zcnd 9748 . . . . . . 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 9748 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  M  e.  CC )
1410, 11, 13mul12d 8468 . . . . . 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 2247 . . . . 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 8336 . . . . . 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 9748 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  N  e.  CC )
19 simpl3r 1084 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  K  =/=  0 )
20 0z 9634 . . . . . . . 8  |-  0  e.  ZZ
21 zapne 9698 . . . . . . . 8  |-  ( ( K  e.  ZZ  /\  0  e.  ZZ )  ->  ( K #  0  <->  K  =/=  0 ) )
229, 20, 21sylancl 417 . . . . . . 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 8979 . . . . 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 12547 . 2  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  -> 
( ( K  x.  M )  ||  ( K  x.  N )  ->  M  ||  N ) )
28 dvdscmul 12563 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  ->  ( M  ||  N  ->  ( K  x.  M )  ||  ( K  x.  N
) ) )
29283adant3r 1266 . 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 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   class class class wbr 4125  (class class class)co 6075   0cc0 8169    x. cmul 8174   # cap 8899   ZZcz 9623    || cdvds 12532
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-inn 9284  df-n0 9543  df-z 9624  df-dvds 12533
This theorem is referenced by:  modmulconst  12568  bitsmod  12701  mulgcd  12771  oddpwdclemxy  12925  oddpwdclemodd  12928  pcpremul  13050  4sqlem17  13164  znrrg  14967
  Copyright terms: Public domain W3C validator