Theorem modqm1p1mod0 10557

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 1003	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> A e. QQ )
2		1z 9433	. . . . 5 |- 1 e. ZZ
3		zq 9782	. . . . 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 1001	. . . . 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 1005	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> 0 < M )
8		modqaddmod 10545	. . . 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 1251	. . 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 5974	. . . . . 6 |- ( ( A mod M ) = ( M - 1 ) -> ( ( A mod M ) + 1 ) = ( ( M - 1 ) + 1 ) )
11	10	oveq1d 5982	. . . . 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 9790	. . . . . . . 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 8485	. . . . . 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 5982	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( ( ( M - 1 ) + 1 ) mod M ) = ( M mod M ) )
19		modqid0 10532	. . . . 5 |- ( ( M e. QQ /\ 0 < M ) -> ( M mod M ) = 0 )
20	6, 7, 19	syl2anc 411	. . . 4 |- ( ( ( A e. QQ /\ M e. QQ /\ 0 < M ) /\ ( A mod M ) = ( M - 1 ) ) -> ( M mod M ) = 0 )
21	12, 18, 20	3eqtrd 2244	. . 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 2242	. 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 ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 981   = wceq 1373   e. wcel 2178   class class class wbr 4059  (class class class)co 5967   CCcc 7958   0cc0 7960   1c1 7961   + caddc 7963   < clt 8142   - cmin 8278   ZZcz 9407   QQcq 9775   mod cmo 10504

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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078  ax-arch 8079

This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-po 4361  df-iso 4362  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-inn 9072  df-n0 9331  df-z 9408  df-q 9776  df-rp 9811  df-fl 10450  df-mod 10505

This theorem is referenced by: (None)