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

Theorem p1modz1 12561
Description: If a number greater than 1 divides another number, the second number increased by 1 is 1 modulo the first number. (Contributed by AV, 19-Mar-2022.)
Assertion
Ref Expression
p1modz1  |-  ( ( M  ||  A  /\  1  <  M )  -> 
( ( A  + 
1 )  mod  M
)  =  1 )

Proof of Theorem p1modz1
StepHypRef Expression
1 dvdszrcl 12559 . . 3  |-  ( M 
||  A  ->  ( M  e.  ZZ  /\  A  e.  ZZ ) )
2 0red 8327 . . . . . . . . . . . . . 14  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
0  e.  RR )
3 1red 8341 . . . . . . . . . . . . . 14  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
1  e.  RR )
4 zre 9648 . . . . . . . . . . . . . . 15  |-  ( M  e.  ZZ  ->  M  e.  RR )
54adantr 276 . . . . . . . . . . . . . 14  |-  ( ( M  e.  ZZ  /\  1  <  M )  ->  M  e.  RR )
62, 3, 53jca 1208 . . . . . . . . . . . . 13  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
( 0  e.  RR  /\  1  e.  RR  /\  M  e.  RR )
)
7 0lt1 8453 . . . . . . . . . . . . . . 15  |-  0  <  1
87a1i 9 . . . . . . . . . . . . . 14  |-  ( M  e.  ZZ  ->  0  <  1 )
98anim1i 340 . . . . . . . . . . . . 13  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
( 0  <  1  /\  1  <  M ) )
10 lttr 8399 . . . . . . . . . . . . 13  |-  ( ( 0  e.  RR  /\  1  e.  RR  /\  M  e.  RR )  ->  (
( 0  <  1  /\  1  <  M )  ->  0  <  M
) )
116, 9, 10sylc 62 . . . . . . . . . . . 12  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
0  <  M )
1211ex 115 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  (
1  <  M  ->  0  <  M ) )
13 elnnz 9654 . . . . . . . . . . . 12  |-  ( M  e.  NN  <->  ( M  e.  ZZ  /\  0  < 
M ) )
1413simplbi2 385 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  (
0  <  M  ->  M  e.  NN ) )
1512, 14syld 45 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  (
1  <  M  ->  M  e.  NN ) )
1615adantr 276 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  A  e.  ZZ )  ->  ( 1  <  M  ->  M  e.  NN ) )
1716imp 124 . . . . . . . 8  |-  ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M
)  ->  M  e.  NN )
18 dvdsmod0 12560 . . . . . . . 8  |-  ( ( M  e.  NN  /\  M  ||  A )  -> 
( A  mod  M
)  =  0 )
1917, 18sylan 283 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  M  ||  A )  ->  ( A  mod  M )  =  0 )
2019ex 115 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M
)  ->  ( M  ||  A  ->  ( A  mod  M )  =  0 ) )
21 oveq1 6092 . . . . . . . . . . 11  |-  ( ( A  mod  M )  =  0  ->  (
( A  mod  M
)  +  1 )  =  ( 0  +  1 ) )
22 0p1e1 9418 . . . . . . . . . . 11  |-  ( 0  +  1 )  =  1
2321, 22eqtrdi 2287 . . . . . . . . . 10  |-  ( ( A  mod  M )  =  0  ->  (
( A  mod  M
)  +  1 )  =  1 )
2423oveq1d 6100 . . . . . . . . 9  |-  ( ( A  mod  M )  =  0  ->  (
( ( A  mod  M )  +  1 )  mod  M )  =  ( 1  mod  M
) )
2524adantl 277 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  (
( ( A  mod  M )  +  1 )  mod  M )  =  ( 1  mod  M
) )
26 zq 10026 . . . . . . . . . 10  |-  ( A  e.  ZZ  ->  A  e.  QQ )
2726ad3antlr 497 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  A  e.  QQ )
28 1z 9670 . . . . . . . . . 10  |-  1  e.  ZZ
29 zq 10026 . . . . . . . . . 10  |-  ( 1  e.  ZZ  ->  1  e.  QQ )
3028, 29mp1i 10 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  1  e.  QQ )
31 zq 10026 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  M  e.  QQ )
3231ad3antrrr 496 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  M  e.  QQ )
3311ad4ant13 517 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  0  <  M )
34 modqaddmod 10800 . . . . . . . . 9  |-  ( ( ( A  e.  QQ  /\  1  e.  QQ )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( ( A  mod  M )  +  1 )  mod  M
)  =  ( ( A  +  1 )  mod  M ) )
3527, 30, 32, 33, 34syl22anc 1279 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  (
( ( A  mod  M )  +  1 )  mod  M )  =  ( ( A  + 
1 )  mod  M
) )
3631adantr 276 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  A  e.  ZZ )  ->  M  e.  QQ )
37 q1mod 10793 . . . . . . . . . 10  |-  ( ( M  e.  QQ  /\  1  <  M )  -> 
( 1  mod  M
)  =  1 )
3836, 37sylan 283 . . . . . . . . 9  |-  ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M
)  ->  ( 1  mod  M )  =  1 )
3938adantr 276 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  (
1  mod  M )  =  1 )
4025, 35, 393eqtr3d 2279 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  (
( A  +  1 )  mod  M )  =  1 )
4140ex 115 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M
)  ->  ( ( A  mod  M )  =  0  ->  ( ( A  +  1 )  mod  M )  =  1 ) )
4220, 41syld 45 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M
)  ->  ( M  ||  A  ->  ( ( A  +  1 )  mod  M )  =  1 ) )
4342ex 115 . . . 4  |-  ( ( M  e.  ZZ  /\  A  e.  ZZ )  ->  ( 1  <  M  ->  ( M  ||  A  ->  ( ( A  + 
1 )  mod  M
)  =  1 ) ) )
4443com23 78 . . 3  |-  ( ( M  e.  ZZ  /\  A  e.  ZZ )  ->  ( M  ||  A  ->  ( 1  <  M  ->  ( ( A  + 
1 )  mod  M
)  =  1 ) ) )
451, 44mpcom 36 . 2  |-  ( M 
||  A  ->  (
1  <  M  ->  ( ( A  +  1 )  mod  M )  =  1 ) )
4645imp 124 1  |-  ( ( M  ||  A  /\  1  <  M )  -> 
( ( A  + 
1 )  mod  M
)  =  1 )
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   RRcr 8178   0cc0 8179   1c1 8180    + caddc 8182    < clt 8360   NNcn 9304   ZZcz 9644   QQcq 10019    mod cmo 10759    || 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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  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-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 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-q 10020  df-rp 10055  df-fl 10705  df-mod 10760  df-dvds 12555
This theorem is used by:  lgslem4  16122
  Copyright terms: Public domain W3C validator