Theorem modqm1p1mod0 10812

Description: If a number modulo a modulus equals the modulus decreased by 1, the first number increased by 1 modulo the modulus equals 0. (Contributed by Jim Kingdon, 24-Oct-2021.)

Assertion

Ref	Expression
modqm1p1mod0	|- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> ( ( A mod M ) = ( M - 1 ) -> ( ( A + 1 ) mod M ) = 0 ) )

Proof of Theorem modqm1p1mod0

Step	Hyp	Ref	Expression
1		simpl1 1031	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> A e. QQ )
2		1z 9670	. . . . 5 |- 1 e. ZZ
3		zq 10026	. . . . 5 |- ( 1 e. ZZ -> 1 e. QQ )
4	2, 3	mp1i 10	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> 1 e. QQ )
5		simp2 1029	. . . . 5 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> M e. QQ )
6	5	adantr 276	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> M e. QQ )
7		simpl3 1033	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> 0 < M )
8		modqaddmod 10800	. . . 4 |- ( ( ( A e. QQ /\ 1 e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A + 1 ) mod M ) )
9	1, 4, 6, 7, 8	syl22anc 1279	. . 3 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A + 1 ) mod M ) )
10		oveq1 6092	. . . . . 6 |- ( ( A mod M ) = ( M - 1 ) -> ( ( A mod M ) + 1 ) = ( ( M - 1 ) + 1 ) )
11	10	oveq1d 6100	. . . . 5 |- ( ( A mod M ) = ( M - 1 ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( ( M - 1 ) + 1 ) mod M ) )
12	11	adantl 277	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( ( M - 1 ) + 1 ) mod M ) )
13		qcn 10034	. . . . . . . 8 |- ( M e. QQ -> M e. CC )
14	5, 13	syl 14	. . . . . . 7 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> M e. CC )
15	14	adantr 276	. . . . . 6 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> M e. CC )
16		npcan1 8705	. . . . . 6 |- ( M e. CC -> ( ( M - 1 ) + 1 ) = M )
17	15, 16	syl 14	. . . . 5 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( M - 1 ) + 1 ) = M )
18	17	oveq1d 6100	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( ( M - 1 ) + 1 ) mod M ) = ( M mod M ) )
19		modqid0 10787	. . . . 5 |- ( ( M e. QQ /\ 0 < M ) -> ( M mod M ) = 0 )
20	6, 7, 19	syl2anc 415	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( M mod M ) = 0 )
21	12, 18, 20	3eqtrd 2275	. . 3 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = 0 )
22	9, 21	eqtr3d 2273	. 2 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( A + 1 ) mod M ) = 0 )
23	22	ex 115	1 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> ( ( A mod M ) = ( M - 1 ) -> ( ( A + 1 ) mod M ) = 0 ) )

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   CCcc 8177   0cc0 8179   1c1 8180   + caddc 8182   < clt 8360   - cmin 8497   ZZcz 9644   QQcq 10019   mod cmo 10759

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

This theorem is used by: (None)