Theorem p1modz1 12484

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 12482	. . 3 |- ( M || A -> ( M e. ZZ /\ A e. ZZ ) )
2		0red 8277	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> 0 e. RR )
3		1red 8291	. . . . . . . . . . . . . 14 |- ( ( M e. ZZ /\ 1 < M ) -> 1 e. RR )
4		zre 9583	. . . . . . . . . . . . . . 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 8402	. . . . . . . . . . . . . . 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 8349	. . . . . . . . . . . . 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 9589	. . . . . . . . . . . 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 12483	. . . . . . . 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 6059	. . . . . . . . . . 11 |- ( ( A mod M ) = 0 -> ( ( A mod M ) + 1 ) = ( 0 + 1 ) )
22		0p1e1 9353	. . . . . . . . . . 11 |- ( 0 + 1 ) = 1
23	21, 22	eqtrdi 2283	. . . . . . . . . 10 |- ( ( A mod M ) = 0 -> ( ( A mod M ) + 1 ) = 1 )
24	23	oveq1d 6067	. . . . . . . . 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 9961	. . . . . . . . . 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 9605	. . . . . . . . . 10 |- 1 e. ZZ
29		zq 9961	. . . . . . . . . 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 9961	. . . . . . . . . 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 10729	. . . . . . . . 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 10722	. . . . . . . . . 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 4111  (class class class)co 6052   RRcr 8128   0cc0 8129   1c1 8130   + caddc 8132   < clt 8310   NNcn 9239   ZZcz 9579   QQcq 9954   mod cmo 10688   || cdvds 12477

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 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-mulrcl 8228  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-precex 8239  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245  ax-pre-mulgt0 8246  ax-pre-mulext 8247  ax-arch 8248

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 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-po 4419  df-iso 4420  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-reap 8851  df-ap 8858  df-div 8949  df-inn 9240  df-n0 9499  df-z 9580  df-q 9955  df-rp 9990  df-fl 10634  df-mod 10689  df-dvds 12478

This theorem is referenced by:  lgslem4  15893