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

Theorem dvdsmod 12655
Description: Any number  K whose mod base  N is divisible by a divisor  P of the base is also divisible by 
P. This means that primes will also be relatively prime to the base when reduced  mod 
N for any base. (Contributed by Mario Carneiro, 13-Mar-2014.)
Assertion
Ref Expression
dvdsmod  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( P  ||  ( K  mod  N )  <-> 
P  ||  K )
)

Proof of Theorem dvdsmod
StepHypRef Expression
1 simpl3 1033 . . . . 5  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  K  e.  ZZ )
2 zq 10043 . . . . 5  |-  ( K  e.  ZZ  ->  K  e.  QQ )
31, 2syl 14 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  K  e.  QQ )
4 simpl2 1032 . . . . 5  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  N  e.  NN )
5 nnq 10050 . . . . 5  |-  ( N  e.  NN  ->  N  e.  QQ )
64, 5syl 14 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  N  e.  QQ )
74nngt0d 9358 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  0  <  N
)
8 modqval 10783 . . . 4  |-  ( ( K  e.  QQ  /\  N  e.  QQ  /\  0  <  N )  ->  ( K  mod  N )  =  ( K  -  ( N  x.  ( |_ `  ( K  /  N
) ) ) ) )
93, 6, 7, 8syl3anc 1278 . . 3  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( K  mod  N )  =  ( K  -  ( N  x.  ( |_ `  ( K  /  N ) ) ) ) )
109breq2d 4143 . 2  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( P  ||  ( K  mod  N )  <-> 
P  ||  ( K  -  ( N  x.  ( |_ `  ( K  /  N ) ) ) ) ) )
11 simpl1 1031 . . . . . . . 8  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  e.  NN )
1211nnzd 9779 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  e.  ZZ )
134nnzd 9779 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  N  e.  ZZ )
14 znq 10041 . . . . . . . . 9  |-  ( ( K  e.  ZZ  /\  N  e.  NN )  ->  ( K  /  N
)  e.  QQ )
151, 4, 14syl2anc 415 . . . . . . . 8  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( K  /  N )  e.  QQ )
1615flqcld 10732 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( |_ `  ( K  /  N
) )  e.  ZZ )
17 simpr 110 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  ||  N
)
1812, 13, 16, 17dvdsmultr1d 12625 . . . . . 6  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  ||  ( N  x.  ( |_ `  ( K  /  N
) ) ) )
1913, 16zmulcld 9786 . . . . . . . 8  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( N  x.  ( |_ `  ( K  /  N ) ) )  e.  ZZ )
2019zcnd 9781 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( N  x.  ( |_ `  ( K  /  N ) ) )  e.  CC )
2120subid1d 8634 . . . . . 6  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( N  x.  ( |_ `  ( K  /  N
) ) )  - 
0 )  =  ( N  x.  ( |_
`  ( K  /  N ) ) ) )
2218, 21breqtrrd 4159 . . . . 5  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  ||  (
( N  x.  ( |_ `  ( K  /  N ) ) )  -  0 ) )
23 0zd 9668 . . . . . 6  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  0  e.  ZZ )
24 moddvds 12592 . . . . . 6  |-  ( ( P  e.  NN  /\  ( N  x.  ( |_ `  ( K  /  N ) ) )  e.  ZZ  /\  0  e.  ZZ )  ->  (
( ( N  x.  ( |_ `  ( K  /  N ) ) )  mod  P )  =  ( 0  mod 
P )  <->  P  ||  (
( N  x.  ( |_ `  ( K  /  N ) ) )  -  0 ) ) )
2511, 19, 23, 24syl3anc 1278 . . . . 5  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( ( N  x.  ( |_
`  ( K  /  N ) ) )  mod  P )  =  ( 0  mod  P
)  <->  P  ||  ( ( N  x.  ( |_
`  ( K  /  N ) ) )  -  0 ) ) )
2622, 25mpbird 167 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( N  x.  ( |_ `  ( K  /  N
) ) )  mod 
P )  =  ( 0  mod  P ) )
2726eqeq2d 2250 . . 3  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( K  mod  P )  =  ( ( N  x.  ( |_ `  ( K  /  N ) ) )  mod  P )  <-> 
( K  mod  P
)  =  ( 0  mod  P ) ) )
28 moddvds 12592 . . . 4  |-  ( ( P  e.  NN  /\  K  e.  ZZ  /\  ( N  x.  ( |_ `  ( K  /  N
) ) )  e.  ZZ )  ->  (
( K  mod  P
)  =  ( ( N  x.  ( |_
`  ( K  /  N ) ) )  mod  P )  <->  P  ||  ( K  -  ( N  x.  ( |_ `  ( K  /  N ) ) ) ) ) )
2911, 1, 19, 28syl3anc 1278 . . 3  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( K  mod  P )  =  ( ( N  x.  ( |_ `  ( K  /  N ) ) )  mod  P )  <-> 
P  ||  ( K  -  ( N  x.  ( |_ `  ( K  /  N ) ) ) ) ) )
30 moddvds 12592 . . . 4  |-  ( ( P  e.  NN  /\  K  e.  ZZ  /\  0  e.  ZZ )  ->  (
( K  mod  P
)  =  ( 0  mod  P )  <->  P  ||  ( K  -  0 ) ) )
3111, 1, 23, 30syl3anc 1278 . . 3  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( K  mod  P )  =  ( 0  mod  P
)  <->  P  ||  ( K  -  0 ) ) )
3227, 29, 313bitr3d 218 . 2  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( P  ||  ( K  -  ( N  x.  ( |_ `  ( K  /  N
) ) ) )  <-> 
P  ||  ( K  -  0 ) ) )
331zcnd 9781 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  K  e.  CC )
3433subid1d 8634 . . 3  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( K  - 
0 )  =  K )
3534breq2d 4143 . 2  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( P  ||  ( K  -  0
)  <->  P  ||  K ) )
3610, 32, 353bitrd 214 1  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( P  ||  ( K  mod  N )  <-> 
P  ||  K )
)
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   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   0cc0 8186    x. cmul 8191    < clt 8367    - cmin 8505    / cdiv 9011   NNcn 9314   ZZcz 9656   QQcq 10036   |_cfl 10721    mod cmo 10781    || cdvds 12580
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 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305
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-csb 3148  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-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-po 4443  df-iso 4444  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-n0 9576  df-z 9657  df-q 10037  df-rp 10073  df-fl 10723  df-mod 10782  df-dvds 12581
This theorem is used by:  ppiublem1  16303  lgsdir2lem2  16365
  Copyright terms: Public domain W3C validator