Theorem p1modz1 12539

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 12537	. . 3 |- ( M || A -> ( M e. ZZ /\ A e. ZZ ) )
2		0red 8317	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> 0 e. RR )
3		1red 8331	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> 1 e. RR )
4		zre 9627	. . . . . . . . . . . . . . 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 1208	. . . . . . . . . . . . 13 |- ( ( M e. ZZ /\ 1 < M ) -> ( 0 e. RR /\ 1 e. RR /\ M e. RR ) )
7		0lt1 8443	. . . . . . . . . . . . . . 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 8389	. . . . . . . . . . . . 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 9633	. . . . . . . . . . . 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 12538	. . . . . . . 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 6082	. . . . . . . . . . 11 |- ( ( A mod M ) = 0 -> ( ( A mod M ) + 1 ) = ( 0 + 1 ) )
22		0p1e1 9397	. . . . . . . . . . 11 |- ( 0 + 1 ) = 1
23	21, 22	eqtrdi 2287	. . . . . . . . . 10 |- ( ( A mod M ) = 0 -> ( ( A mod M ) + 1 ) = 1 )
24	23	oveq1d 6090	. . . . . . . . 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 10005	. . . . . . . . . 10 |- ( A e. ZZ -> A e. QQ )
27	26	ad3antlr 497	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> A e. QQ )
28		1z 9649	. . . . . . . . . 10 |- 1 e. ZZ
29		zq 10005	. . . . . . . . . 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 10005	. . . . . . . . . 10 |- ( M e. ZZ -> M e. QQ )
32	31	ad3antrrr 496	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> M e. QQ )
33	11	ad4ant13 517	. . . . . . . . 9 |- ( ( ( ( M e. ZZ /\ A e. ZZ ) /\ 1 < M ) /\ ( A mod M ) = 0 ) -> 0 < M )
34		modqaddmod 10778	. . . . . . . . 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 1279	. . . . . . . 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 10771	. . . . . . . . . 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 2279	. . . . . . 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 1009   = wceq 1402   e. wcel 2209   class class class wbr 4125  (class class class)co 6075   RRcr 8168   0cc0 8169   1c1 8170   + caddc 8172   < clt 8350   NNcn 9283   ZZcz 9623   QQcq 9998   mod cmo 10737   || cdvds 12532

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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288

This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-n0 9543  df-z 9624  df-q 9999  df-rp 10034  df-fl 10683  df-mod 10738  df-dvds 12533

This theorem is referenced by:  lgslem4  16036