Theorem modqltm1p1mod 10523

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

Step	Hyp	Ref	Expression
1		simpll 527	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> A e. QQ )
2		1z 9400	. . . 4 |- 1 e. ZZ
3		zq 9749	. . . 4 |- ( 1 e. ZZ -> 1 e. QQ )
4	2, 3	mp1i 10	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 1 e. QQ )
5		simprl 529	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> M e. QQ )
6		simprr 531	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 < M )
7		modqaddmod 10510	. . 3 |- ( ( ( A e. QQ /\ 1 e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A + 1 ) mod M ) )
8	1, 4, 5, 6, 7	syl22anc 1251	. 2 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A + 1 ) mod M ) )
9	1, 5, 6	modqcld 10475	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A mod M ) e. QQ )
10		qaddcl 9758	. . . 4 |- ( ( ( A mod M ) e. QQ /\ 1 e. QQ ) -> ( ( A mod M ) + 1 ) e. QQ )
11	9, 4, 10	syl2anc 411	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A mod M ) + 1 ) e. QQ )
12		0red 8075	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 e. RR )
13		qre 9748	. . . . 5 |- ( ( A mod M ) e. QQ -> ( A mod M ) e. RR )
14	9, 13	syl 14	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A mod M ) e. RR )
15		1red 8089	. . . . 5 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 1 e. RR )
16	14, 15	readdcld 8104	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A mod M ) + 1 ) e. RR )
17		modqge0 10479	. . . . 5 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> 0 <_ ( A mod M ) )
18	1, 5, 6, 17	syl3anc 1250	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 <_ ( A mod M ) )
19	14	lep1d 9006	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A mod M ) <_ ( ( A mod M ) + 1 ) )
20	12, 14, 16, 18, 19	letrd 8198	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> 0 <_ ( ( A mod M ) + 1 ) )
21		simplr 528	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( A mod M ) < ( M - 1 ) )
22		qre 9748	. . . . . 6 |- ( M e. QQ -> M e. RR )
23	5, 22	syl 14	. . . . 5 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> M e. RR )
24	14, 15, 23	ltaddsubd 8620	. . . 4 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( A mod M ) + 1 ) < M <-> ( A mod M ) < ( M - 1 ) ) )
25	21, 24	mpbird 167	. . 3 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A mod M ) + 1 ) < M )
26		modqid 10496	. . 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 ) )
27	11, 5, 20, 25, 26	syl22anc 1251	. 2 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A mod M ) + 1 ) )
28	8, 27	eqtr3d 2240	1 |- ( ( ( A e. QQ /\ ( A mod M ) < ( M - 1 ) ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A + 1 ) mod M ) = ( ( A mod M ) + 1 ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1373   e. wcel 2176   class class class wbr 4045  (class class class)co 5946   RRcr 7926   0cc0 7927   1c1 7928   + caddc 7930   < clt 8109   <_ cle 8110   - cmin 8245   ZZcz 9374   QQcq 9742   mod cmo 10469

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4163  ax-pow 4219  ax-pr 4254  ax-un 4481  ax-setind 4586  ax-cnex 8018  ax-resscn 8019  ax-1cn 8020  ax-1re 8021  ax-icn 8022  ax-addcl 8023  ax-addrcl 8024  ax-mulcl 8025  ax-mulrcl 8026  ax-addcom 8027  ax-mulcom 8028  ax-addass 8029  ax-mulass 8030  ax-distr 8031  ax-i2m1 8032  ax-0lt1 8033  ax-1rid 8034  ax-0id 8035  ax-rnegex 8036  ax-precex 8037  ax-cnre 8038  ax-pre-ltirr 8039  ax-pre-ltwlin 8040  ax-pre-lttrn 8041  ax-pre-apti 8042  ax-pre-ltadd 8043  ax-pre-mulgt0 8044  ax-pre-mulext 8045  ax-arch 8046

This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4046  df-opab 4107  df-mpt 4108  df-id 4341  df-po 4344  df-iso 4345  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-ima 4689  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-fv 5280  df-riota 5901  df-ov 5949  df-oprab 5950  df-mpo 5951  df-1st 6228  df-2nd 6229  df-pnf 8111  df-mnf 8112  df-xr 8113  df-ltxr 8114  df-le 8115  df-sub 8247  df-neg 8248  df-reap 8650  df-ap 8657  df-div 8748  df-inn 9039  df-n0 9298  df-z 9375  df-q 9743  df-rp 9778  df-fl 10415  df-mod 10470

This theorem is referenced by: (None)