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

Theorem p1modz1 11937
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 11935 . . 3  |-  ( M 
||  A  ->  ( M  e.  ZZ  /\  A  e.  ZZ ) )
2 0red 8020 . . . . . . . . . . . . . 14  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
0  e.  RR )
3 1red 8034 . . . . . . . . . . . . . 14  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
1  e.  RR )
4 zre 9321 . . . . . . . . . . . . . . 15  |-  ( M  e.  ZZ  ->  M  e.  RR )
54adantr 276 . . . . . . . . . . . . . 14  |-  ( ( M  e.  ZZ  /\  1  <  M )  ->  M  e.  RR )
62, 3, 53jca 1179 . . . . . . . . . . . . 13  |-  ( ( M  e.  ZZ  /\  1  <  M )  -> 
( 0  e.  RR  /\  1  e.  RR  /\  M  e.  RR )
)
7 0lt1 8146 . . . . . . . . . . . . . . 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 8093 . . . . . . . . . . . . 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 9327 . . . . . . . . . . . 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 11936 . . . . . . . 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 5925 . . . . . . . . . . 11  |-  ( ( A  mod  M )  =  0  ->  (
( A  mod  M
)  +  1 )  =  ( 0  +  1 ) )
22 0p1e1 9096 . . . . . . . . . . 11  |-  ( 0  +  1 )  =  1
2321, 22eqtrdi 2242 . . . . . . . . . 10  |-  ( ( A  mod  M )  =  0  ->  (
( A  mod  M
)  +  1 )  =  1 )
2423oveq1d 5933 . . . . . . . . 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 9691 . . . . . . . . . 10  |-  ( A  e.  ZZ  ->  A  e.  QQ )
2726ad3antlr 493 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  A  e.  QQ )
28 1z 9343 . . . . . . . . . 10  |-  1  e.  ZZ
29 zq 9691 . . . . . . . . . 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 9691 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  M  e.  QQ )
3231ad3antrrr 492 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  M  e.  QQ )
3311ad4ant13 513 . . . . . . . . 9  |-  ( ( ( ( M  e.  ZZ  /\  A  e.  ZZ )  /\  1  <  M )  /\  ( A  mod  M )  =  0 )  ->  0  <  M )
34 modqaddmod 10434 . . . . . . . . 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 1250 . . . . . . . 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 10427 . . . . . . . . . 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 2234 . . . . . . 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
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    = wceq 1364    e. wcel 2164   class class class wbr 4029  (class class class)co 5918   RRcr 7871   0cc0 7872   1c1 7873    + caddc 7875    < clt 8054   NNcn 8982   ZZcz 9317   QQcq 9684    mod cmo 10393    || cdvds 11930
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990  ax-arch 7991
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-po 4327  df-iso 4328  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-n0 9241  df-z 9318  df-q 9685  df-rp 9720  df-fl 10339  df-mod 10394  df-dvds 11931
This theorem is referenced by:  lgslem4  15119
  Copyright terms: Public domain W3C validator