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

Theorem zdiv 9713
Description: Two ways to express " M divides  N. (Contributed by NM, 3-Oct-2008.)
Assertion
Ref Expression
zdiv  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( E. k  e.  ZZ  ( M  x.  k )  =  N  <-> 
( N  /  M
)  e.  ZZ ) )
Distinct variable groups:    k, M    k, N

Proof of Theorem zdiv
StepHypRef Expression
1 nnap0 9312 . . 3  |-  ( M  e.  NN  ->  M #  0 )
21adantr 276 . 2  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  M #  0 )
3 nncn 9291 . . 3  |-  ( M  e.  NN  ->  M  e.  CC )
4 zcn 9628 . . 3  |-  ( N  e.  ZZ  ->  N  e.  CC )
5 zcn 9628 . . . . . . . . . . 11  |-  ( k  e.  ZZ  ->  k  e.  CC )
6 divcanap3 9018 . . . . . . . . . . . . 13  |-  ( ( k  e.  CC  /\  M  e.  CC  /\  M #  0 )  ->  (
( M  x.  k
)  /  M )  =  k )
763coml 1241 . . . . . . . . . . . 12  |-  ( ( M  e.  CC  /\  M #  0  /\  k  e.  CC )  ->  (
( M  x.  k
)  /  M )  =  k )
873expa 1234 . . . . . . . . . . 11  |-  ( ( ( M  e.  CC  /\  M #  0 )  /\  k  e.  CC )  ->  ( ( M  x.  k )  /  M
)  =  k )
95, 8sylan2 286 . . . . . . . . . 10  |-  ( ( ( M  e.  CC  /\  M #  0 )  /\  k  e.  ZZ )  ->  ( ( M  x.  k )  /  M
)  =  k )
1093adantl2 1185 . . . . . . . . 9  |-  ( ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  /\  k  e.  ZZ )  ->  (
( M  x.  k
)  /  M )  =  k )
11 oveq1 6082 . . . . . . . . 9  |-  ( ( M  x.  k )  =  N  ->  (
( M  x.  k
)  /  M )  =  ( N  /  M ) )
1210, 11sylan9req 2292 . . . . . . . 8  |-  ( ( ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  /\  k  e.  ZZ )  /\  ( M  x.  k )  =  N )  ->  k  =  ( N  /  M ) )
13 simplr 533 . . . . . . . 8  |-  ( ( ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  /\  k  e.  ZZ )  /\  ( M  x.  k )  =  N )  ->  k  e.  ZZ )
1412, 13eqeltrrd 2316 . . . . . . 7  |-  ( ( ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  /\  k  e.  ZZ )  /\  ( M  x.  k )  =  N )  ->  ( N  /  M )  e.  ZZ )
1514exp31 364 . . . . . 6  |-  ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  ->  (
k  e.  ZZ  ->  ( ( M  x.  k
)  =  N  -> 
( N  /  M
)  e.  ZZ ) ) )
1615rexlimdv 2667 . . . . 5  |-  ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  ->  ( E. k  e.  ZZ  ( M  x.  k
)  =  N  -> 
( N  /  M
)  e.  ZZ ) )
17 divcanap2 9000 . . . . . . 7  |-  ( ( N  e.  CC  /\  M  e.  CC  /\  M #  0 )  ->  ( M  x.  ( N  /  M ) )  =  N )
18173com12 1238 . . . . . 6  |-  ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  ->  ( M  x.  ( N  /  M ) )  =  N )
19 oveq2 6083 . . . . . . . . 9  |-  ( k  =  ( N  /  M )  ->  ( M  x.  k )  =  ( M  x.  ( N  /  M
) ) )
2019eqeq1d 2247 . . . . . . . 8  |-  ( k  =  ( N  /  M )  ->  (
( M  x.  k
)  =  N  <->  ( M  x.  ( N  /  M
) )  =  N ) )
2120rspcev 2929 . . . . . . 7  |-  ( ( ( N  /  M
)  e.  ZZ  /\  ( M  x.  ( N  /  M ) )  =  N )  ->  E. k  e.  ZZ  ( M  x.  k
)  =  N )
2221expcom 116 . . . . . 6  |-  ( ( M  x.  ( N  /  M ) )  =  N  ->  (
( N  /  M
)  e.  ZZ  ->  E. k  e.  ZZ  ( M  x.  k )  =  N ) )
2318, 22syl 14 . . . . 5  |-  ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  ->  (
( N  /  M
)  e.  ZZ  ->  E. k  e.  ZZ  ( M  x.  k )  =  N ) )
2416, 23impbid 129 . . . 4  |-  ( ( M  e.  CC  /\  N  e.  CC  /\  M #  0 )  ->  ( E. k  e.  ZZ  ( M  x.  k
)  =  N  <->  ( N  /  M )  e.  ZZ ) )
25243expia 1236 . . 3  |-  ( ( M  e.  CC  /\  N  e.  CC )  ->  ( M #  0  -> 
( E. k  e.  ZZ  ( M  x.  k )  =  N  <-> 
( N  /  M
)  e.  ZZ ) ) )
263, 4, 25syl2an 289 . 2  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M #  0  -> 
( E. k  e.  ZZ  ( M  x.  k )  =  N  <-> 
( N  /  M
)  e.  ZZ ) ) )
272, 26mpd 13 1  |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( E. k  e.  ZZ  ( M  x.  k )  =  N  <-> 
( N  /  M
)  e.  ZZ ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   E.wrex 2529   class class class wbr 4125  (class class class)co 6075   CCcc 8167   0cc0 8169    x. cmul 8174   # cap 8899    / cdiv 8992   NNcn 9283   ZZcz 9623
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-rmo 2536  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-div 8993  df-inn 9284  df-z 9624
This theorem is referenced by:  addmodlteq  10813
  Copyright terms: Public domain W3C validator