ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  modqltm1p1mod Unicode version
Theorem modqltm1p1mod 10834
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 531 . . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> A e. QQ )
2 1z 9681 . . . 4 |- 1 e. ZZ
3 zq 10042 . . . 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 535 . . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> M e. QQ )
6 simprr 537 . . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 < M )
7 modqaddmod 10821 . . 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 1279 . 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 10786 . . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A mod M ) e. QQ )
10 qaddcl 10051 . . . 4 |- ( ( ( A mod M ) e. QQ /\ 1 e. QQ ) -> ( ( A mod M ) + 1 ) e. QQ )
119, 4, 10syl2anc 415 . . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A mod M ) + 1 ) e. QQ )
12 0red 8333 . . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 e. RR )
13 qre 10041 . . . . 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 8347 . . . . 5 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 1 e. RR )
1614, 15readdcld 8361 . . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A mod M ) + 1 ) e. RR )
17 modqge0 10790 . . . . 5 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> 0 <_ ( A mod M ) )
181, 5, 6, 17syl3anc 1278 . . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 <_ ( A mod M ) )
1914lep1d 9269 . . . 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 8457 . . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 <_ ( ( A mod M ) + 1 ) )
21 simplr 533 . . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A mod M ) < ( M - 1 ) )
22 qre 10041 . . . . . 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 8880 . . . 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 167 . . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A mod M ) + 1 ) < M )
26 modqid 10807 . . 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 1279 . 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 2273 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
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   class class class wbr 4131  (class class class)co 6088   RRcr 8184   0cc0 8185   1c1 8186   + caddc 8188   < clt 8366   <_ cle 8367   - cmin 8504   ZZcz 9655   QQcq 10035   mod cmo 10780
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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-po 4443  df-iso 4444  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-n0 9575  df-z 9656  df-q 10036  df-rp 10072  df-fl 10722  df-mod 10781
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator