Theorem mulqaddmodid 10332

Description: The sum of a positive rational number less than an upper bound and the product of an integer and the upper bound is the positive rational number modulo the upper bound. (Contributed by Jim Kingdon, 23-Oct-2021.)

Assertion

Ref	Expression
mulqaddmodid	|- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( ( N x. M ) + A ) mod M ) = A )

Proof of Theorem mulqaddmodid

Step	Hyp	Ref	Expression
1		simpll 527	. . . . . 6 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> N e. ZZ )
2	1	zcnd 9347	. . . . 5 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> N e. CC )
3		qre 9596	. . . . . . 7 |- ( M e. QQ -> M e. RR )
4	3	ad2antlr 489	. . . . . 6 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. RR )
5	4	recnd 7960	. . . . 5 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. CC )
6	2, 5	mulcld 7952	. . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( N x. M ) e. CC )
7		simprr 531	. . . . . . 7 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. ( 0 [,) M ) )
8		0red 7933	. . . . . . . 8 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> 0 e. RR )
9	4	rexrd 7981	. . . . . . . 8 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. RR* )
10		elico2 9906	. . . . . . . 8 |- ( ( 0 e. RR /\ M e. RR* ) -> ( A e. ( 0 [,) M ) <-> ( A e. RR /\ 0 <_ A /\ A < M ) ) )
11	8, 9, 10	syl2anc 411	. . . . . . 7 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( A e. ( 0 [,) M ) <-> ( A e. RR /\ 0 <_ A /\ A < M ) ) )
12	7, 11	mpbid 147	. . . . . 6 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( A e. RR /\ 0 <_ A /\ A < M ) )
13	12	simp1d 1009	. . . . 5 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. RR )
14	13	recnd 7960	. . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. CC )
15	6, 14	addcomd 8082	. . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( N x. M ) + A ) = ( A + ( N x. M ) ) )
16	15	oveq1d 5880	. 2 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( ( N x. M ) + A ) mod M ) = ( ( A + ( N x. M ) ) mod M ) )
17		simprl 529	. . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A e. QQ )
18		simplr 528	. . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> M e. QQ )
19	12	simp2d 1010	. . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> 0 <_ A )
20	12	simp3d 1011	. . . 4 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> A < M )
21	8, 13, 4, 19, 20	lelttrd 8056	. . 3 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> 0 < M )
22		modqcyc 10327	. . 3 |- ( ( ( A e. QQ /\ N e. ZZ ) /\ ( M e. QQ /\ 0 < M ) ) -> ( ( A + ( N x. M ) ) mod M ) = ( A mod M ) )
23	17, 1, 18, 21, 22	syl22anc 1239	. 2 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( A + ( N x. M ) ) mod M ) = ( A mod M ) )
24		modqid 10317	. . 3 |- ( ( ( A e. QQ /\ M e. QQ ) /\ ( 0 <_ A /\ A < M ) ) -> ( A mod M ) = A )
25	17, 18, 19, 20, 24	syl22anc 1239	. 2 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( A mod M ) = A )
26	16, 23, 25	3eqtrd 2212	1 |- ( ( ( N e. ZZ /\ M e. QQ ) /\ ( A e. QQ /\ A e. ( 0 [,) M ) ) ) -> ( ( ( N x. M ) + A ) mod M ) = A )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 978   = wceq 1353   e. wcel 2146   class class class wbr 3998  (class class class)co 5865   RRcr 7785   0cc0 7786   + caddc 7789   x. cmul 7791   RR*cxr 7965   < clt 7966   <_ cle 7967   ZZcz 9224   QQcq 9590   [,)cico 9859   mod cmo 10290

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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-mulrcl 7885  ax-addcom 7886  ax-mulcom 7887  ax-addass 7888  ax-mulass 7889  ax-distr 7890  ax-i2m1 7891  ax-0lt1 7892  ax-1rid 7893  ax-0id 7894  ax-rnegex 7895  ax-precex 7896  ax-cnre 7897  ax-pre-ltirr 7898  ax-pre-ltwlin 7899  ax-pre-lttrn 7900  ax-pre-apti 7901  ax-pre-ltadd 7902  ax-pre-mulgt0 7903  ax-pre-mulext 7904  ax-arch 7905

This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-po 4290  df-iso 4291  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-1st 6131  df-2nd 6132  df-pnf 7968  df-mnf 7969  df-xr 7970  df-ltxr 7971  df-le 7972  df-sub 8104  df-neg 8105  df-reap 8506  df-ap 8513  df-div 8602  df-inn 8891  df-n0 9148  df-z 9225  df-q 9591  df-rp 9623  df-ico 9863  df-fl 10238  df-mod 10291

This theorem is referenced by:  modqmuladd  10334  addmodid  10340