Theorem modqmuladd 10458

Description: Decomposition of an integer into a multiple of a modulus and a remainder. (Contributed by Jim Kingdon, 23-Oct-2021.)

Hypotheses

Ref	Expression
modqmuladd.a	|- ( ph -> A e. ZZ )
modqmuladd.bq	|- ( ph -> B e. QQ )
modqmuladd.b	|- ( ph -> B e. ( 0 [,) M ) )
modqmuladd.m	|- ( ph -> M e. QQ )
modqmuladd.mgt0	|- ( ph -> 0 < M )

Assertion

Ref	Expression
modqmuladd	|- ( ph -> ( ( A mod M ) = B <-> E. k e. ZZ A = ( ( k x. M ) + B ) ) )

Distinct variable groups:   A, k   B, k   k, M   ph, k

Proof of Theorem modqmuladd

Step	Hyp	Ref	Expression
1		modqmuladd.a	. . . . . . 7 |- ( ph -> A e. ZZ )
2		zq 9700	. . . . . . 7 |- ( A e. ZZ -> A e. QQ )
3	1, 2	syl 14	. . . . . 6 |- ( ph -> A e. QQ )
4		modqmuladd.m	. . . . . 6 |- ( ph -> M e. QQ )
5		modqmuladd.mgt0	. . . . . . 7 |- ( ph -> 0 < M )
6	5	gt0ne0d 8539	. . . . . 6 |- ( ph -> M =/= 0 )
7		qdivcl 9717	. . . . . 6 |- ( ( A e. QQ /\ M e. QQ /\ M =/= 0 ) -> ( A / M ) e. QQ )
8	3, 4, 6, 7	syl3anc 1249	. . . . 5 |- ( ph -> ( A / M ) e. QQ )
9	8	flqcld 10367	. . . 4 |- ( ph -> ( |_ ` ( A / M ) ) e. ZZ )
10		oveq1 5929	. . . . . . 7 |- ( k = ( |_ ` ( A / M ) ) -> ( k x. M ) = ( ( |_ ` ( A / M ) ) x. M ) )
11	10	oveq1d 5937	. . . . . 6 |- ( k = ( |_ ` ( A / M ) ) -> ( ( k x. M ) + ( A mod M ) ) = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) )
12	11	eqeq2d 2208	. . . . 5 |- ( k = ( |_ ` ( A / M ) ) -> ( A = ( ( k x. M ) + ( A mod M ) ) <-> A = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) ) )
13	12	adantl 277	. . . 4 |- ( ( ph /\ k = ( |_ ` ( A / M ) ) ) -> ( A = ( ( k x. M ) + ( A mod M ) ) <-> A = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) ) )
14		flqpmodeq 10419	. . . . . 6 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) = A )
15	3, 4, 5, 14	syl3anc 1249	. . . . 5 |- ( ph -> ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) = A )
16	15	eqcomd 2202	. . . 4 |- ( ph -> A = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) )
17	9, 13, 16	rspcedvd 2874	. . 3 |- ( ph -> E. k e. ZZ A = ( ( k x. M ) + ( A mod M ) ) )
18		oveq2 5930	. . . . . 6 |- ( B = ( A mod M ) -> ( ( k x. M ) + B ) = ( ( k x. M ) + ( A mod M ) ) )
19	18	eqeq2d 2208	. . . . 5 |- ( B = ( A mod M ) -> ( A = ( ( k x. M ) + B ) <-> A = ( ( k x. M ) + ( A mod M ) ) ) )
20	19	eqcoms 2199	. . . 4 |- ( ( A mod M ) = B -> ( A = ( ( k x. M ) + B ) <-> A = ( ( k x. M ) + ( A mod M ) ) ) )
21	20	rexbidv 2498	. . 3 |- ( ( A mod M ) = B -> ( E. k e. ZZ A = ( ( k x. M ) + B ) <-> E. k e. ZZ A = ( ( k x. M ) + ( A mod M ) ) ) )
22	17, 21	syl5ibrcom 157	. 2 |- ( ph -> ( ( A mod M ) = B -> E. k e. ZZ A = ( ( k x. M ) + B ) ) )
23		oveq1 5929	. . . . . 6 |- ( A = ( ( k x. M ) + B ) -> ( A mod M ) = ( ( ( k x. M ) + B ) mod M ) )
24	23	adantl 277	. . . . 5 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> ( A mod M ) = ( ( ( k x. M ) + B ) mod M ) )
25		simplr 528	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> k e. ZZ )
26	4	ad2antrr 488	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> M e. QQ )
27		modqmuladd.bq	. . . . . . 7 |- ( ph -> B e. QQ )
28	27	ad2antrr 488	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> B e. QQ )
29		modqmuladd.b	. . . . . . 7 |- ( ph -> B e. ( 0 [,) M ) )
30	29	ad2antrr 488	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> B e. ( 0 [,) M ) )
31		mulqaddmodid 10456	. . . . . 6 |- ( ( ( k e. ZZ /\ M e. QQ ) /\ ( B e. QQ /\ B e. ( 0 [,) M ) ) ) -> ( ( ( k x. M ) + B ) mod M ) = B )
32	25, 26, 28, 30, 31	syl22anc 1250	. . . . 5 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> ( ( ( k x. M ) + B ) mod M ) = B )
33	24, 32	eqtrd 2229	. . . 4 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> ( A mod M ) = B )
34	33	ex 115	. . 3 |- ( ( ph /\ k e. ZZ ) -> ( A = ( ( k x. M ) + B ) -> ( A mod M ) = B ) )
35	34	rexlimdva 2614	. 2 |- ( ph -> ( E. k e. ZZ A = ( ( k x. M ) + B ) -> ( A mod M ) = B ) )
36	22, 35	impbid 129	1 |- ( ph -> ( ( A mod M ) = B <-> E. k e. ZZ A = ( ( k x. M ) + B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2167   =/= wne 2367   E.wrex 2476   class class class wbr 4033   ` cfv 5258  (class class class)co 5922   0cc0 7879   + caddc 7882   x. cmul 7884   < clt 8061   / cdiv 8699   ZZcz 9326   QQcq 9693   [,)cico 9965   |_cfl 10358   mod cmo 10414

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997  ax-arch 7998

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-po 4331  df-iso 4332  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-n0 9250  df-z 9327  df-q 9694  df-rp 9729  df-ico 9969  df-fl 10360  df-mod 10415

This theorem is referenced by:  modqmuladdim  10459