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

Theorem dvdsmodexp 12562
Description: If a positive integer divides another integer, this other integer is equal to its positive powers modulo the positive integer. (Formerly part of the proof for fermltl 13012). (Contributed by Mario Carneiro, 28-Feb-2014.) (Revised by AV, 19-Mar-2022.)
Assertion
Ref Expression
dvdsmodexp  |-  ( ( N  e.  NN  /\  B  e.  NN  /\  N  ||  A )  ->  (
( A ^ B
)  mod  N )  =  ( A  mod  N ) )

Proof of Theorem dvdsmodexp
StepHypRef Expression
1 dvdszrcl 12559 . . 3  |-  ( N 
||  A  ->  ( N  e.  ZZ  /\  A  e.  ZZ ) )
2 dvdsmod0 12560 . . . . . . . . 9  |-  ( ( N  e.  NN  /\  N  ||  A )  -> 
( A  mod  N
)  =  0 )
323ad2antl2 1191 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  N  ||  A )  ->  ( A  mod  N )  =  0 )
43ex 115 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  ->  ( N  ||  A  ->  ( A  mod  N )  =  0 ) )
5 simpl3 1033 . . . . . . . . . . 11  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  B  e.  NN )
650expd 11127 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( 0 ^ B )  =  0 )
76oveq1d 6100 . . . . . . . . 9  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( ( 0 ^ B )  mod 
N )  =  ( 0  mod  N ) )
8 simpl1 1031 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  A  e.  ZZ )
9 0zd 9656 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  0  e.  ZZ )
10 nnnn0 9570 . . . . . . . . . . . 12  |-  ( B  e.  NN  ->  B  e.  NN0 )
11103ad2ant3 1051 . . . . . . . . . . 11  |-  ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  ->  B  e.  NN0 )
1211adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  B  e.  NN0 )
13 simpl2 1032 . . . . . . . . . . 11  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  N  e.  NN )
14 nnq 10033 . . . . . . . . . . 11  |-  ( N  e.  NN  ->  N  e.  QQ )
1513, 14syl 14 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  N  e.  QQ )
16 nnrp 10064 . . . . . . . . . . . . 13  |-  ( N  e.  NN  ->  N  e.  RR+ )
17163ad2ant2 1050 . . . . . . . . . . . 12  |-  ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  ->  N  e.  RR+ )
1817adantr 276 . . . . . . . . . . 11  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  N  e.  RR+ )
1918rpgt0d 10100 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  0  <  N
)
20 simpr 110 . . . . . . . . . . 11  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( A  mod  N )  =  0 )
21 q0mod 10792 . . . . . . . . . . . 12  |-  ( ( N  e.  QQ  /\  0  <  N )  -> 
( 0  mod  N
)  =  0 )
2215, 19, 21syl2anc 415 . . . . . . . . . . 11  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( 0  mod 
N )  =  0 )
2320, 22eqtr4d 2274 . . . . . . . . . 10  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( A  mod  N )  =  ( 0  mod  N ) )
248, 9, 12, 15, 19, 23modqexp 11104 . . . . . . . . 9  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( ( A ^ B )  mod 
N )  =  ( ( 0 ^ B
)  mod  N )
)
257, 24, 233eqtr4d 2281 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  /\  ( A  mod  N
)  =  0 )  ->  ( ( A ^ B )  mod 
N )  =  ( A  mod  N ) )
2625ex 115 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  ->  (
( A  mod  N
)  =  0  -> 
( ( A ^ B )  mod  N
)  =  ( A  mod  N ) ) )
274, 26syld 45 . . . . . 6  |-  ( ( A  e.  ZZ  /\  N  e.  NN  /\  B  e.  NN )  ->  ( N  ||  A  ->  (
( A ^ B
)  mod  N )  =  ( A  mod  N ) ) )
28273exp 1233 . . . . 5  |-  ( A  e.  ZZ  ->  ( N  e.  NN  ->  ( B  e.  NN  ->  ( N  ||  A  -> 
( ( A ^ B )  mod  N
)  =  ( A  mod  N ) ) ) ) )
2928com24 87 . . . 4  |-  ( A  e.  ZZ  ->  ( N  ||  A  ->  ( B  e.  NN  ->  ( N  e.  NN  ->  ( ( A ^ B
)  mod  N )  =  ( A  mod  N ) ) ) ) )
3029adantl 277 . . 3  |-  ( ( N  e.  ZZ  /\  A  e.  ZZ )  ->  ( N  ||  A  ->  ( B  e.  NN  ->  ( N  e.  NN  ->  ( ( A ^ B )  mod  N
)  =  ( A  mod  N ) ) ) ) )
311, 30mpcom 36 . 2  |-  ( N 
||  A  ->  ( B  e.  NN  ->  ( N  e.  NN  ->  ( ( A ^ B
)  mod  N )  =  ( A  mod  N ) ) ) )
32313imp31 1227 1  |-  ( ( N  e.  NN  /\  B  e.  NN  /\  N  ||  A )  ->  (
( A ^ B
)  mod  N )  =  ( A  mod  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 4130  (class class class)co 6085   0cc0 8179    < clt 8360   NNcn 9304   NN0cn0 9563   ZZcz 9644   QQcq 10019   RR+crp 10054    mod cmo 10759   ^cexp 10975    || cdvds 12554
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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298
This proof depends on definitions:  df-bi 117  df-dc 847  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-nul 3521  df-if 3639  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-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-fl 10705  df-mod 10760  df-seqfrec 10885  df-exp 10976  df-dvds 12555
This theorem is used by:  fermltl  13012
  Copyright terms: Public domain W3C validator