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

Theorem dvdsval2 12476
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 12475 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  E. k  e.  ZZ  (
k  x.  M )  =  N ) )
213adant2 1043 . 2  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  E. k  e.  ZZ  ( k  x.  M )  =  N ) )
3 zcn 9582 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  CC )
433ad2ant3 1047 . . . . . . . . . 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 9582 . . . . . . . . . 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 9582 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  M  e.  CC )
983ad2ant1 1045 . . . . . . . . . 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 1028 . . . . . . . . . 10  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M  =/=  0
)
12 0z 9588 . . . . . . . . . . . . 13  |-  0  e.  ZZ
13 zapne 9652 . . . . . . . . . . . . 13  |-  ( ( M  e.  ZZ  /\  0  e.  ZZ )  ->  ( M #  0  <->  M  =/=  0 ) )
1412, 13mpan2 425 . . . . . . . . . . . 12  |-  ( M  e.  ZZ  ->  ( M #  0  <->  M  =/=  0
) )
15143ad2ant1 1045 . . . . . . . . . . 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 9099 . . . . . . . 8  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( N  /  M )  =  k  <->  N  =  (
k  x.  M ) ) )
19 eqcom 2234 . . . . . . . 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 531 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
k  e.  ZZ )
2422, 23eqeltrd 2309 . . . 4  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
( N  /  M
)  e.  ZZ )
2524rexlimdvaa 2661 . . 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 1025 . . . . . . . 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 9065 . . . . . 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 6057 . . . . . . 7  |-  ( k  =  ( N  /  M )  ->  (
k  x.  M )  =  ( ( N  /  M )  x.  M ) )
3231eqeq1d 2241 . . . . . 6  |-  ( k  =  ( N  /  M )  ->  (
( k  x.  M
)  =  N  <->  ( ( N  /  M )  x.  M )  =  N ) )
3332rspcev 2921 . . . . 5  |-  ( ( ( N  /  M
)  e.  ZZ  /\  ( ( N  /  M )  x.  M
)  =  N )  ->  E. k  e.  ZZ  ( k  x.  M
)  =  N )
3426, 30, 33syl2anc 411 . . . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203    =/= wne 2412   E.wrex 2521   class class class wbr 4109  (class class class)co 6050   CCcc 8125   0cc0 8127    x. cmul 8132   # cap 8855    / cdiv 8946   ZZcz 9577    || cdvds 12473
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-n0 9497  df-z 9578  df-dvds 12474
This theorem is referenced by:  dvdsval3  12477  nndivdvds  12482  fsumdvds  12528  divconjdvds  12535  3dvds  12550  zeo3  12554  evend2  12575  oddp1d2  12576  fldivndvdslt  12623  bitsmod  12642  divgcdz  12667  dvdsgcdidd  12690  mulgcd  12712  sqgcd  12725  lcmgcdlem  12774  mulgcddvds  12791  qredeu  12794  prmind2  12817  isprm5lem  12838  divgcdodd  12840  divnumden  12893  hashdvds  12918  hashgcdlem  12935  pythagtriplem19  12980  pcprendvds2  12989  pcpremul  12991  pc2dvds  13028  pcz  13030  dvdsprmpweqle  13035  pcadd  13038  pcmptdvds  13043  fldivp1  13046  pockthlem  13054  4sqlem8  13083  4sqlem9  13084  4sqlem12  13100  4sqlem14  13102  znidomb  14806  lgseisenlem1  15943  lgsquad2lem1  15954  lgsquad3  15957  m1lgs  15958  2sqlem3  15990  2sqlem8  15996
  Copyright terms: Public domain W3C validator