Theorem modqmuladd 10803

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 10026	. . . . . . 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 8840	. . . . . 6 |- ( ph -> M =/= 0 )
7		qdivcl 10043	. . . . . 6 |- ( ( A e. QQ /\ M e. QQ /\ M =/= 0 ) -> ( A / M ) e. QQ )
8	3, 4, 6, 7	syl3anc 1278	. . . . 5 |- ( ph -> ( A / M ) e. QQ )
9	8	flqcld 10712	. . . 4 |- ( ph -> ( |_ ` ( A / M ) ) e. ZZ )
10		oveq1 6092	. . . . . . 7 |- ( k = ( |_ ` ( A / M ) ) -> ( k x. M ) = ( ( |_ ` ( A / M ) ) x. M ) )
11	10	oveq1d 6100	. . . . . 6 |- ( k = ( |_ ` ( A / M ) ) -> ( ( k x. M ) + ( A mod M ) ) = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) )
12	11	eqeq2d 2250	. . . . 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 10764	. . . . . 6 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) = A )
15	3, 4, 5, 14	syl3anc 1278	. . . . 5 |- ( ph -> ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) = A )
16	15	eqcomd 2244	. . . 4 |- ( ph -> A = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) )
17	9, 13, 16	rspcedvd 2935	. . 3 |- ( ph -> E. k e. ZZ A = ( ( k x. M ) + ( A mod M ) ) )
18		oveq2 6093	. . . . . 6 |- ( B = ( A mod M ) -> ( ( k x. M ) + B ) = ( ( k x. M ) + ( A mod M ) ) )
19	18	eqeq2d 2250	. . . . 5 |- ( B = ( A mod M ) -> ( A = ( ( k x. M ) + B ) <-> A = ( ( k x. M ) + ( A mod M ) ) ) )
20	19	eqcoms 2241	. . . 4 |- ( ( A mod M ) = B -> ( A = ( ( k x. M ) + B ) <-> A = ( ( k x. M ) + ( A mod M ) ) ) )
21	20	rexbidv 2551	. . 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 6092	. . . . . 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 533	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> k e. ZZ )
26	4	ad2antrr 492	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> M e. QQ )
27		modqmuladd.bq	. . . . . . 7 |- ( ph -> B e. QQ )
28	27	ad2antrr 492	. . . . . 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 492	. . . . . 6 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> B e. ( 0 [,) M ) )
31		mulqaddmodid 10801	. . . . . 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 1279	. . . . 5 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> ( ( ( k x. M ) + B ) mod M ) = B )
33	24, 32	eqtrd 2271	. . . 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 2668	. 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 ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   =/= wne 2420   E.wrex 2529   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   0cc0 8179   + caddc 8182   x. cmul 8184   < clt 8360   / cdiv 9002   ZZcz 9644   QQcq 10019   [,)cico 10292   |_cfl 10703   mod cmo 10759

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-q 10020  df-rp 10055  df-ico 10296  df-fl 10705  df-mod 10760

This theorem is used by:  modqmuladdim  10804