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

Theorem dvdscmulr 12346
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 1049 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  K  e.  ZZ )
2 simp1 1021 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  M  e.  ZZ )
31, 2zmulcld 9586 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  -> 
( K  x.  M
)  e.  ZZ )
4 simp2 1022 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  N  e.  ZZ )
51, 4zmulcld 9586 . . . 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 9581 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  K  e.  CC )
118zcnd 9581 . . . . . . 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 9581 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  M  e.  CC )
1410, 11, 13mul12d 8309 . . . . . 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 2238 . . . . 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 8178 . . . . . 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 9581 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  N  e.  CC )
19 simpl3r 1077 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  /\  x  e.  ZZ )  ->  K  =/=  0 )
20 0z 9468 . . . . . . . 8  |-  0  e.  ZZ
21 zapne 9532 . . . . . . . 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 8819 . . . . 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 12328 . 2  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  -> 
( ( K  x.  M )  ||  ( K  x.  N )  ->  M  ||  N ) )
28 dvdscmul 12344 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  ->  ( M  ||  N  ->  ( K  x.  M )  ||  ( K  x.  N
) ) )
29283adant3r 1259 . 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 1002    = wceq 1395    e. wcel 2200    =/= wne 2400   class class class wbr 4083  (class class class)co 6007   0cc0 8010    x. cmul 8015   # cap 8739   ZZcz 9457    || cdvds 12313
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-inn 9122  df-n0 9381  df-z 9458  df-dvds 12314
This theorem is referenced by:  modmulconst  12349  bitsmod  12482  mulgcd  12552  oddpwdclemxy  12706  oddpwdclemodd  12709  pcpremul  12831  4sqlem17  12945  znrrg  14639
  Copyright terms: Public domain W3C validator