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

Theorem modqltm1p1mod 10311
Description: If a number modulo a modulus is less than the modulus decreased by 1, the first number increased by 1 modulo the modulus equals the first number modulo the modulus, increased by 1. (Contributed by Jim Kingdon, 24-Oct-2021.)
Assertion
Ref Expression
modqltm1p1mod  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( A  + 
1 )  mod  M
)  =  ( ( A  mod  M )  +  1 ) )

Proof of Theorem modqltm1p1mod
StepHypRef Expression
1 simpll 519 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  ->  A  e.  QQ )
2 1z 9217 . . . 4  |-  1  e.  ZZ
3 zq 9564 . . . 4  |-  ( 1  e.  ZZ  ->  1  e.  QQ )
42, 3mp1i 10 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
1  e.  QQ )
5 simprl 521 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  ->  M  e.  QQ )
6 simprr 522 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
0  <  M )
7 modqaddmod 10298 . . 3  |-  ( ( ( A  e.  QQ  /\  1  e.  QQ )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( ( A  mod  M )  +  1 )  mod  M
)  =  ( ( A  +  1 )  mod  M ) )
81, 4, 5, 6, 7syl22anc 1229 . 2  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( ( A  mod  M )  +  1 )  mod  M
)  =  ( ( A  +  1 )  mod  M ) )
91, 5, 6modqcld 10263 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( A  mod  M
)  e.  QQ )
10 qaddcl 9573 . . . 4  |-  ( ( ( A  mod  M
)  e.  QQ  /\  1  e.  QQ )  ->  ( ( A  mod  M )  +  1 )  e.  QQ )
119, 4, 10syl2anc 409 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( A  mod  M )  +  1 )  e.  QQ )
12 0red 7900 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
0  e.  RR )
13 qre 9563 . . . . 5  |-  ( ( A  mod  M )  e.  QQ  ->  ( A  mod  M )  e.  RR )
149, 13syl 14 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( A  mod  M
)  e.  RR )
15 1red 7914 . . . . 5  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
1  e.  RR )
1614, 15readdcld 7928 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( A  mod  M )  +  1 )  e.  RR )
17 modqge0 10267 . . . . 5  |-  ( ( A  e.  QQ  /\  M  e.  QQ  /\  0  <  M )  ->  0  <_  ( A  mod  M
) )
181, 5, 6, 17syl3anc 1228 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
0  <_  ( A  mod  M ) )
1914lep1d 8826 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( A  mod  M
)  <_  ( ( A  mod  M )  +  1 ) )
2012, 14, 16, 18, 19letrd 8022 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
0  <_  ( ( A  mod  M )  +  1 ) )
21 simplr 520 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( A  mod  M
)  <  ( M  -  1 ) )
22 qre 9563 . . . . . 6  |-  ( M  e.  QQ  ->  M  e.  RR )
235, 22syl 14 . . . . 5  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  ->  M  e.  RR )
2414, 15, 23ltaddsubd 8443 . . . 4  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( ( A  mod  M )  +  1 )  <  M  <->  ( A  mod  M )  <  ( M  - 
1 ) ) )
2521, 24mpbird 166 . . 3  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( A  mod  M )  +  1 )  <  M )
26 modqid 10284 . . 3  |-  ( ( ( ( ( A  mod  M )  +  1 )  e.  QQ  /\  M  e.  QQ )  /\  ( 0  <_ 
( ( A  mod  M )  +  1 )  /\  ( ( A  mod  M )  +  1 )  <  M
) )  ->  (
( ( A  mod  M )  +  1 )  mod  M )  =  ( ( A  mod  M )  +  1 ) )
2711, 5, 20, 25, 26syl22anc 1229 . 2  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( ( A  mod  M )  +  1 )  mod  M
)  =  ( ( A  mod  M )  +  1 ) )
288, 27eqtr3d 2200 1  |-  ( ( ( A  e.  QQ  /\  ( A  mod  M
)  <  ( M  -  1 ) )  /\  ( M  e.  QQ  /\  0  < 
M ) )  -> 
( ( A  + 
1 )  mod  M
)  =  ( ( A  mod  M )  +  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343    e. wcel 2136   class class class wbr 3982  (class class class)co 5842   RRcr 7752   0cc0 7753   1c1 7754    + caddc 7756    < clt 7933    <_ cle 7934    - cmin 8069   ZZcz 9191   QQcq 9557    mod cmo 10257
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871  ax-arch 7872
This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-po 4274  df-iso 4275  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-n0 9115  df-z 9192  df-q 9558  df-rp 9590  df-fl 10205  df-mod 10258
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator