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

Theorem dvdsval2 12557
Description: One nonzero integer divides another integer if and only if their quotient is an integer. (Contributed by Jeff Hankins, 29-Sep-2013.)
Assertion
Ref Expression
dvdsval2  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  ( N  /  M )  e.  ZZ ) )

Proof of Theorem dvdsval2
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 divides 12556 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  E. k  e.  ZZ  (
k  x.  M )  =  N ) )
213adant2 1047 . 2  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  E. k  e.  ZZ  ( k  x.  M )  =  N ) )
3 zcn 9649 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  CC )
433ad2ant3 1051 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  N  e.  CC )
54adantr 276 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  N  e.  CC )
6 zcn 9649 . . . . . . . . . 10  |-  ( k  e.  ZZ  ->  k  e.  CC )
76adantl 277 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  k  e.  CC )
8 zcn 9649 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  M  e.  CC )
983ad2ant1 1049 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  M  e.  CC )
109adantr 276 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M  e.  CC )
11 simpl2 1032 . . . . . . . . . 10  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M  =/=  0
)
12 0z 9655 . . . . . . . . . . . . 13  |-  0  e.  ZZ
13 zapne 9719 . . . . . . . . . . . . 13  |-  ( ( M  e.  ZZ  /\  0  e.  ZZ )  ->  ( M #  0  <->  M  =/=  0 ) )
1412, 13mpan2 429 . . . . . . . . . . . 12  |-  ( M  e.  ZZ  ->  ( M #  0  <->  M  =/=  0
) )
15143ad2ant1 1049 . . . . . . . . . . 11  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M #  0  <->  M  =/=  0
) )
1615adantr 276 . . . . . . . . . 10  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( M #  0  <-> 
M  =/=  0 ) )
1711, 16mpbird 167 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M #  0 )
185, 7, 10, 17divmulap3d 9155 . . . . . . . 8  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( N  /  M )  =  k  <->  N  =  (
k  x.  M ) ) )
19 eqcom 2240 . . . . . . . 8  |-  ( N  =  ( k  x.  M )  <->  ( k  x.  M )  =  N )
2018, 19bitrdi 196 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( N  /  M )  =  k  <->  ( k  x.  M )  =  N ) )
2120biimprd 158 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( k  x.  M )  =  N  ->  ( N  /  M )  =  k ) )
2221impr 379 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
( N  /  M
)  =  k )
23 simprl 535 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
k  e.  ZZ )
2422, 23eqeltrd 2315 . . . 4  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
( N  /  M
)  e.  ZZ )
2524rexlimdvaa 2669 . . 3  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( E. k  e.  ZZ  ( k  x.  M
)  =  N  -> 
( N  /  M
)  e.  ZZ ) )
26 simpr 110 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( N  /  M )  e.  ZZ )  ->  ( N  /  M )  e.  ZZ )
27 simp2 1029 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  M  =/=  0 )
2827, 15mpbird 167 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  M #  0 )
294, 9, 28divcanap1d 9121 . . . . . 6  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  (
( N  /  M
)  x.  M )  =  N )
3029adantr 276 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( N  /  M )  e.  ZZ )  ->  ( ( N  /  M )  x.  M )  =  N )
31 oveq1 6092 . . . . . . 7  |-  ( k  =  ( N  /  M )  ->  (
k  x.  M )  =  ( ( N  /  M )  x.  M ) )
3231eqeq1d 2247 . . . . . 6  |-  ( k  =  ( N  /  M )  ->  (
( k  x.  M
)  =  N  <->  ( ( N  /  M )  x.  M )  =  N ) )
3332rspcev 2929 . . . . 5  |-  ( ( ( N  /  M
)  e.  ZZ  /\  ( ( N  /  M )  x.  M
)  =  N )  ->  E. k  e.  ZZ  ( k  x.  M
)  =  N )
3426, 30, 33syl2anc 415 . . . 4  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( N  /  M )  e.  ZZ )  ->  E. k  e.  ZZ  ( k  x.  M
)  =  N )
3534ex 115 . . 3  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  (
( N  /  M
)  e.  ZZ  ->  E. k  e.  ZZ  (
k  x.  M )  =  N ) )
3625, 35impbid 129 . 2  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( E. k  e.  ZZ  ( k  x.  M
)  =  N  <->  ( N  /  M )  e.  ZZ ) )
372, 36bitrd 188 1  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  ( N  /  M )  e.  ZZ ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   E.wrex 2529   class class class wbr 4130  (class class class)co 6085   CCcc 8177   0cc0 8179    x. cmul 8184   # cap 8909    / cdiv 9002   ZZcz 9644    || cdvds 12554
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-dvds 12555
This theorem is used by:  dvdsval3  12558  nndivdvds  12563  fsumdvds  12609  divconjdvds  12616  3dvds  12631  zeo3  12635  evend2  12656  oddp1d2  12657  fldivndvdslt  12704  bitsmod  12723  divgcdz  12748  dvdsgcdidd  12771  mulgcd  12793  sqgcd  12806  lcmgcdlem  12855  mulgcddvds  12872  qredeu  12875  prmind2  12898  isprm5lem  12919  divgcdodd  12921  divnumden  12974  hashdvds  12999  hashgcdlem  13016  pythagtriplem19  13061  pcprendvds2  13070  pcpremul  13072  pc2dvds  13109  pcz  13111  dvdsprmpweqle  13116  pcadd  13119  pcmptdvds  13124  fldivp1  13127  pockthlem  13135  4sqlem8  13164  4sqlem9  13165  4sqlem12  13181  4sqlem14  13183  znidomb  14993  lgseisenlem1  16189  lgsquad2lem1  16200  lgsquad3  16203  m1lgs  16204  2sqlem3  16236  2sqlem8  16242
  Copyright terms: Public domain W3C validator