ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dvds2add Unicode version
Theorem dvds2add 12617
Description: If an integer divides each of two other integers, it divides their sum. (Contributed by Paul Chapman, 21-Mar-2011.)
Assertion
Ref Expression
dvds2add |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( K || M /\ K || N ) -> K || ( M + N ) ) )
Proof of Theorem dvds2add
Dummy variables x y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 3simpa 1025 . 2 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( K e. ZZ /\ M e. ZZ ) )
2 3simpb 1026 . 2 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( K e. ZZ /\ N e. ZZ ) )
3 zaddcl 9695 . . . 4 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M + N ) e. ZZ )
43anim2i 342 . . 3 |- ( ( K e. ZZ /\ ( M e. ZZ /\ N e. ZZ ) ) -> ( K e. ZZ /\ ( M + N ) e. ZZ ) )
543impb 1230 . 2 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( K e. ZZ /\ ( M + N ) e. ZZ ) )
6 zaddcl 9695 . . 3 |- ( ( x e. ZZ /\ y e. ZZ ) -> ( x + y ) e. ZZ )
76adantl 277 . 2 |- ( ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) /\ ( x e. ZZ /\ y e. ZZ ) ) -> ( x + y ) e. ZZ )
8 zcn 9660 . . . . . . . 8 |- ( x e. ZZ -> x e. CC )
9 zcn 9660 . . . . . . . 8 |- ( y e. ZZ -> y e. CC )
10 zcn 9660 . . . . . . . 8 |- ( K e. ZZ -> K e. CC )
11 adddir 8323 . . . . . . . 8 |- ( ( x e. CC /\ y e. CC /\ K e. CC ) -> ( ( x + y ) x. K ) = ( ( x x. K ) + ( y x. K ) ) )
128, 9, 10, 11syl3an 1320 . . . . . . 7 |- ( ( x e. ZZ /\ y e. ZZ /\ K e. ZZ ) -> ( ( x + y ) x. K ) = ( ( x x. K ) + ( y x. K ) ) )
13123comr 1242 . . . . . 6 |- ( ( K e. ZZ /\ x e. ZZ /\ y e. ZZ ) -> ( ( x + y ) x. K ) = ( ( x x. K ) + ( y x. K ) ) )
14133expb 1235 . . . . 5 |- ( ( K e. ZZ /\ ( x e. ZZ /\ y e. ZZ ) ) -> ( ( x + y ) x. K ) = ( ( x x. K ) + ( y x. K ) ) )
15 oveq12 6097 . . . . 5 |- ( ( ( x x. K ) = M /\ ( y x. K ) = N ) -> ( ( x x. K ) + ( y x. K ) ) = ( M + N ) )
1614, 15sylan9eq 2291 . . . 4 |- ( ( ( K e. ZZ /\ ( x e. ZZ /\ y e. ZZ ) ) /\ ( ( x x. K ) = M /\ ( y x. K ) = N ) ) -> ( ( x + y ) x. K ) = ( M + N ) )
1716ex 115 . . 3 |- ( ( K e. ZZ /\ ( x e. ZZ /\ y e. ZZ ) ) -> ( ( ( x x. K ) = M /\ ( y x. K ) = N ) -> ( ( x + y ) x. K ) = ( M + N ) ) )
18173ad2antl1 1190 . 2 |- ( ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) /\ ( x e. ZZ /\ y e. ZZ ) ) -> ( ( ( x x. K ) = M /\ ( y x. K ) = N ) -> ( ( x + y ) x. K ) = ( M + N ) ) )
191, 2, 5, 7, 18dvds2lem 12595 1 |- ( ( K e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( K || M /\ K || N ) -> K || ( M + N ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4131  (class class class)co 6088   CCcc 8183   + caddc 8188   x. cmul 8190   ZZcz 9655   || cdvds 12579
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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301
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-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 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-dvds 12580
This theorem is used by:  dvds2addd  12621  dvdssub2  12627  dvdsadd2b  12632  bezoutlemstep  12799  bezoutlembi  12807  dvdsmulgcd  12827  bezoutr  12834  pythagtriplem19  13090  4sqlem16  13214  dec2dvds  13219  lgsquadlem1  16401
  Copyright terms: Public domain W3C validator