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

Theorem dvdsmod 12647
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 10036 . . . . 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 10043 . . . . 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 9351 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  0  <  N
)
8 modqval 10775 . . . 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 4142 . 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 9772 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  e.  ZZ )
134nnzd 9772 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  N  e.  ZZ )
14 znq 10034 . . . . . . . . 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 10725 . . . . . . 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 12617 . . . . . 6  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  ||  ( N  x.  ( |_ `  ( K  /  N
) ) ) )
1913, 16zmulcld 9779 . . . . . . . 8  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( N  x.  ( |_ `  ( K  /  N ) ) )  e.  ZZ )
2019zcnd 9774 . . . . . . 7  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( N  x.  ( |_ `  ( K  /  N ) ) )  e.  CC )
2120subid1d 8628 . . . . . 6  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( ( N  x.  ( |_ `  ( K  /  N
) ) )  - 
0 )  =  ( N  x.  ( |_
`  ( K  /  N ) ) ) )
2218, 21breqtrrd 4158 . . . . 5  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  P  ||  (
( N  x.  ( |_ `  ( K  /  N ) ) )  -  0 ) )
23 0zd 9661 . . . . . 6  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  0  e.  ZZ )
24 moddvds 12584 . . . . . 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 12584 . . . 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 12584 . . . 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 9774 . . . 4  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  K  e.  CC )
3433subid1d 8628 . . 3  |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( K  - 
0 )  =  K )
3534breq2d 4142 . 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 4130   ` cfv 5377  (class class class)co 6085   0cc0 8180    x. cmul 8185    < clt 8361    - cmin 8499    / cdiv 9005   NNcn 9307   ZZcz 9649   QQcq 10029   |_cfl 10714    mod cmo 10773    || cdvds 12572
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 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298  ax-arch 8299
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 4131  df-opab 4193  df-mpt 4194  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-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-inn 9308  df-n0 9569  df-z 9650  df-q 10030  df-rp 10066  df-fl 10716  df-mod 10774  df-dvds 12573
This theorem is used by:  ppiublem1  16213  lgsdir2lem2  16270
  Copyright terms: Public domain W3C validator