Theorem p1modz1 12505

Description: If a number greater than 1 divides another number, the second number increased by 1 is 1 modulo the first number. (Contributed by AV, 19-Mar-2022.)

Assertion

Ref	Expression
p1modz1	|- ( ( M || A /\ 1 < M ) -> ( ( A + 1 ) mod M ) = 1 )

Proof of Theorem p1modz1

Step	Hyp	Ref	Expression
1		dvdszrcl 12503	. . 3 |- ( M || A -> ( M e. ZZ /\ A e. ZZ ) )
2		0red 8291	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> 0 e. RR )
3		1red 8305	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> 1 e. RR )
4		zre 9598	. . . . . . . . . . . . . . 15 |- ( M e. ZZ -> M e. RR )
5	4	adantr 276	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> M e. RR )
6	2, 3, 5	3jca 1204	. . . . . . . . . . . . 13 |- ( ( M e. ZZ /\ 1 < M ) -> ( 0 e. RR /\ 1 e. RR /\ M e. RR ) )
7		0lt1 8416	. . . . . . . . . . . . . . 15 |- 0 < 1
8	7	a1i 9	. . . . . . . . . . . . . 14 |- ( M e. ZZ -> 0 < 1 )
9	8	anim1i 340	. . . . . . . . . . . . 13 |- ( ( M e. ZZ /\ 1 < M ) -> ( 0 < 1 /\ 1 < M ) )
10		lttr 8363	. . . . . . . . . . . . 13 |- ( ( 0 e. RR /\ 1 e. RR /\ M e. RR ) -> ( ( 0 < 1 /\ 1 < M ) -> 0 < M ) )
11	6, 9, 10	sylc 62	. . . . . . . . . . . 12 |- ( ( M e. ZZ /\ 1 < M ) -> 0 < M )
12	11	ex 115	. . . . . . . . . . 11 |- ( M e. ZZ -> ( 1 < M -> 0 < M ) )
13		elnnz 9604	. . . . . . . . . . . 12 |- ( M e. NN <-> ( M e. ZZ /\ 0 < M ) )
14	13	simplbi2 385	. . . . . . . . . . 11 |- ( M e. ZZ -> ( 0 < M -> M e. NN ) )
15	12, 14	syld 45	. . . . . . . . . 10 |- ( M e. ZZ -> ( 1 < M -> M e. NN ) )
16	15	adantr 276	. . . . . . . . 9 |- ( ( M e. ZZ /\ A e. ZZ ) -> ( 1 < M -> M e. NN ) )
17	16	imp 124	. . . . . . . 8 |- ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) -> M e. NN )
18		dvdsmod0 12504	. . . . . . . 8 |- ( ( M e. NN /\ M || A ) -> ( A mod M ) = 0 )
19	17, 18	sylan 283	. . . . . . 7 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ M || A ) -> ( A mod M ) = 0 )
20	19	ex 115	. . . . . 6 |- ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) -> ( M || A -> ( A mod M ) = 0 ) )
21		oveq1 6065	. . . . . . . . . . 11 |- ( ( A mod M ) = 0 -> ( ( A mod M ) + 1 ) = ( 0 + 1 ) )
22		0p1e1 9368	. . . . . . . . . . 11 |- ( 0 + 1 ) = 1
23	21, 22	eqtrdi 2283	. . . . . . . . . 10 |- ( ( A mod M ) = 0 -> ( ( A mod M ) + 1 ) = 1 )
24	23	oveq1d 6073	. . . . . . . . 9 |- ( ( A mod M ) = 0 -> ( ( ( A mod M ) + 1 ) mod M ) = ( 1 mod M ) )
25	24	adantl 277	. . . . . . . 8 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( 1 mod M ) )
26		zq 9976	. . . . . . . . . 10 |- ( A e. ZZ -> A e. QQ )
27	26	ad3antlr 493	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> A e. QQ )
28		1z 9620	. . . . . . . . . 10 |- 1 e. ZZ
29		zq 9976	. . . . . . . . . 10 |- ( 1 e. ZZ -> 1 e. QQ )
30	28, 29	mp1i 10	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> 1 e. QQ )
31		zq 9976	. . . . . . . . . 10 |- ( M e. ZZ -> M e. QQ )
32	31	ad3antrrr 492	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> M e. QQ )
33	11	ad4ant13 513	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> 0 < M )
34		modqaddmod 10749	. . . . . . . . 9 |- ( ( ( A e. QQ /\ 1 e. QQ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A + 1 ) mod M ) )
35	27, 30, 32, 33, 34	syl22anc 1275	. . . . . . . 8 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> ( ( ( A mod M ) + 1 ) mod M ) = ( ( A + 1 ) mod M ) )
36	31	adantr 276	. . . . . . . . . 10 |- ( ( M e. ZZ /\ A e. ZZ ) -> M e. QQ )
37		q1mod 10742	. . . . . . . . . 10 |- ( ( M e. QQ /\ 1 < M ) -> ( 1 mod M ) = 1 )
38	36, 37	sylan 283	. . . . . . . . 9 |- ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) -> ( 1 mod M ) = 1 )
39	38	adantr 276	. . . . . . . 8 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> ( 1 mod M ) = 1 )
40	25, 35, 39	3eqtr3d 2275	. . . . . . 7 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> ( ( A + 1 ) mod M ) = 1 )
41	40	ex 115	. . . . . 6 |- ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) -> ( ( A mod M ) = 0 -> ( ( A + 1 ) mod M ) = 1 ) )
42	20, 41	syld 45	. . . . 5 |- ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) -> ( M || A -> ( ( A + 1 ) mod M ) = 1 ) )
43	42	ex 115	. . . 4 |- ( ( M e. ZZ /\ A e. ZZ ) -> ( 1 < M -> ( M || A -> ( ( A + 1 ) mod M ) = 1 ) ) )
44	43	com23 78	. . 3 |- ( ( M e. ZZ /\ A e. ZZ ) -> ( M || A -> ( 1 < M -> ( ( A + 1 ) mod M ) = 1 ) ) )
45	1, 44	mpcom 36	. 2 |- ( M || A -> ( 1 < M -> ( ( A + 1 ) mod M ) = 1 ) )
46	45	imp 124	1 |- ( ( M || A /\ 1 < M ) -> ( ( A + 1 ) mod M ) = 1 )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2205   class class class wbr 4114  (class class class)co 6058   RRcr 8142   0cc0 8143   1c1 8144   + caddc 8146   < clt 8324   NNcn 9254   ZZcz 9594   QQcq 9969   mod cmo 10708   || cdvds 12498

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-po 4422  df-iso 4423  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-n0 9514  df-z 9595  df-q 9970  df-rp 10005  df-fl 10654  df-mod 10709  df-dvds 12499

This theorem is referenced by:  lgslem4  16002