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

Theorem dvdsval2 11496
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 11495 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  E. k  e.  ZZ  (
k  x.  M )  =  N ) )
213adant2 1000 . 2  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  E. k  e.  ZZ  ( k  x.  M )  =  N ) )
3 zcn 9059 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  CC )
433ad2ant3 1004 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  N  e.  CC )
54adantr 274 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  N  e.  CC )
6 zcn 9059 . . . . . . . . . 10  |-  ( k  e.  ZZ  ->  k  e.  CC )
76adantl 275 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  k  e.  CC )
8 zcn 9059 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  M  e.  CC )
983ad2ant1 1002 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  M  e.  CC )
109adantr 274 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M  e.  CC )
11 simpl2 985 . . . . . . . . . 10  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M  =/=  0
)
12 0z 9065 . . . . . . . . . . . . 13  |-  0  e.  ZZ
13 zapne 9125 . . . . . . . . . . . . 13  |-  ( ( M  e.  ZZ  /\  0  e.  ZZ )  ->  ( M #  0  <->  M  =/=  0 ) )
1412, 13mpan2 421 . . . . . . . . . . . 12  |-  ( M  e.  ZZ  ->  ( M #  0  <->  M  =/=  0
) )
15143ad2ant1 1002 . . . . . . . . . . 11  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M #  0  <->  M  =/=  0
) )
1615adantr 274 . . . . . . . . . 10  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( M #  0  <-> 
M  =/=  0 ) )
1711, 16mpbird 166 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  M #  0 )
185, 7, 10, 17divmulap3d 8585 . . . . . . . 8  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( N  /  M )  =  k  <->  N  =  (
k  x.  M ) ) )
19 eqcom 2141 . . . . . . . 8  |-  ( N  =  ( k  x.  M )  <->  ( k  x.  M )  =  N )
2018, 19syl6bb 195 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( N  /  M )  =  k  <->  ( k  x.  M )  =  N ) )
2120biimprd 157 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  k  e.  ZZ )  ->  ( ( k  x.  M )  =  N  ->  ( N  /  M )  =  k ) )
2221impr 376 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
( N  /  M
)  =  k )
23 simprl 520 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
k  e.  ZZ )
2422, 23eqeltrd 2216 . . . 4  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( k  e.  ZZ  /\  ( k  x.  M )  =  N ) )  -> 
( N  /  M
)  e.  ZZ )
2524rexlimdvaa 2550 . . 3  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( E. k  e.  ZZ  ( k  x.  M
)  =  N  -> 
( N  /  M
)  e.  ZZ ) )
26 simpr 109 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( N  /  M )  e.  ZZ )  ->  ( N  /  M )  e.  ZZ )
27 simp2 982 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  M  =/=  0 )
2827, 15mpbird 166 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  M #  0 )
294, 9, 28divcanap1d 8551 . . . . . 6  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  (
( N  /  M
)  x.  M )  =  N )
3029adantr 274 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( N  /  M )  e.  ZZ )  ->  ( ( N  /  M )  x.  M )  =  N )
31 oveq1 5781 . . . . . . 7  |-  ( k  =  ( N  /  M )  ->  (
k  x.  M )  =  ( ( N  /  M )  x.  M ) )
3231eqeq1d 2148 . . . . . 6  |-  ( k  =  ( N  /  M )  ->  (
( k  x.  M
)  =  N  <->  ( ( N  /  M )  x.  M )  =  N ) )
3332rspcev 2789 . . . . 5  |-  ( ( ( N  /  M
)  e.  ZZ  /\  ( ( N  /  M )  x.  M
)  =  N )  ->  E. k  e.  ZZ  ( k  x.  M
)  =  N )
3426, 30, 33syl2anc 408 . . . 4  |-  ( ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  /\  ( N  /  M )  e.  ZZ )  ->  E. k  e.  ZZ  ( k  x.  M
)  =  N )
3534ex 114 . . 3  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  (
( N  /  M
)  e.  ZZ  ->  E. k  e.  ZZ  (
k  x.  M )  =  N ) )
3625, 35impbid 128 . 2  |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( E. k  e.  ZZ  ( k  x.  M
)  =  N  <->  ( N  /  M )  e.  ZZ ) )
372, 36bitrd 187 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 103    <-> wb 104    /\ w3a 962    = wceq 1331    e. wcel 1480    =/= wne 2308   E.wrex 2417   class class class wbr 3929  (class class class)co 5774   CCcc 7618   0cc0 7620    x. cmul 7625   # cap 8343    / cdiv 8432   ZZcz 9054    || cdvds 11493
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-mulrcl 7719  ax-addcom 7720  ax-mulcom 7721  ax-addass 7722  ax-mulass 7723  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-1rid 7727  ax-0id 7728  ax-rnegex 7729  ax-precex 7730  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736  ax-pre-mulgt0 7737  ax-pre-mulext 7738
This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-br 3930  df-opab 3990  df-id 4215  df-po 4218  df-iso 4219  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-reap 8337  df-ap 8344  df-div 8433  df-inn 8721  df-n0 8978  df-z 9055  df-dvds 11494
This theorem is referenced by:  dvdsval3  11497  nndivdvds  11499  divconjdvds  11547  zeo3  11565  evend2  11586  oddp1d2  11587  fldivndvdslt  11632  divgcdz  11660  dvdsgcdidd  11682  mulgcd  11704  sqgcd  11717  lcmgcdlem  11758  mulgcddvds  11775  qredeu  11778  prmind2  11801  divgcdodd  11821  divnumden  11874  hashdvds  11897  hashgcdlem  11903
  Copyright terms: Public domain W3C validator