Theorem modqmuladd 10533

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 9767	. . . . . . 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 8605	. . . . . 6 |- ( ph -> M =/= 0 )
7		qdivcl 9784	. . . . . 6 |- ( ( A e. QQ /\ M e. QQ /\ M =/= 0 ) -> ( A / M ) e. QQ )
8	3, 4, 6, 7	syl3anc 1250	. . . . 5 |- ( ph -> ( A / M ) e. QQ )
9	8	flqcld 10442	. . . 4 |- ( ph -> ( |_ ` ( A / M ) ) e. ZZ )
10		oveq1 5964	. . . . . . 7 |- ( k = ( |_ ` ( A / M ) ) -> ( k x. M ) = ( ( |_ ` ( A / M ) ) x. M ) )
11	10	oveq1d 5972	. . . . . 6 |- ( k = ( |_ ` ( A / M ) ) -> ( ( k x. M ) + ( A mod M ) ) = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) )
12	11	eqeq2d 2218	. . . . 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 10494	. . . . . 6 |- ( ( A e. QQ /\ M e. QQ /\ 0 < M ) -> ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) = A )
15	3, 4, 5, 14	syl3anc 1250	. . . . 5 |- ( ph -> ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) = A )
16	15	eqcomd 2212	. . . 4 |- ( ph -> A = ( ( ( |_ ` ( A / M ) ) x. M ) + ( A mod M ) ) )
17	9, 13, 16	rspcedvd 2887	. . 3 |- ( ph -> E. k e. ZZ A = ( ( k x. M ) + ( A mod M ) ) )
18		oveq2 5965	. . . . . 6 |- ( B = ( A mod M ) -> ( ( k x. M ) + B ) = ( ( k x. M ) + ( A mod M ) ) )
19	18	eqeq2d 2218	. . . . 5 |- ( B = ( A mod M ) -> ( A = ( ( k x. M ) + B ) <-> A = ( ( k x. M ) + ( A mod M ) ) ) )
20	19	eqcoms 2209	. . . 4 |- ( ( A mod M ) = B -> ( A = ( ( k x. M ) + B ) <-> A = ( ( k x. M ) + ( A mod M ) ) ) )
21	20	rexbidv 2508	. . 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 5964	. . . . . 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 10531	. . . . . 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 1251	. . . . 5 |- ( ( ( ph /\ k e. ZZ ) /\ A = ( ( k x. M ) + B ) ) -> ( ( ( k x. M ) + B ) mod M ) = B )
33	24, 32	eqtrd 2239	. . . 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 2624	. 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 1373   e. wcel 2177   =/= wne 2377   E.wrex 2486   class class class wbr 4051   ` cfv 5280  (class class class)co 5957   0cc0 7945   + caddc 7948   x. cmul 7950   < clt 8127   / cdiv 8765   ZZcz 9392   QQcq 9760   [,)cico 10032   |_cfl 10433   mod cmo 10489

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-mulrcl 8044  ax-addcom 8045  ax-mulcom 8046  ax-addass 8047  ax-mulass 8048  ax-distr 8049  ax-i2m1 8050  ax-0lt1 8051  ax-1rid 8052  ax-0id 8053  ax-rnegex 8054  ax-precex 8055  ax-cnre 8056  ax-pre-ltirr 8057  ax-pre-ltwlin 8058  ax-pre-lttrn 8059  ax-pre-apti 8060  ax-pre-ltadd 8061  ax-pre-mulgt0 8062  ax-pre-mulext 8063  ax-arch 8064

This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-po 4351  df-iso 4352  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-1st 6239  df-2nd 6240  df-pnf 8129  df-mnf 8130  df-xr 8131  df-ltxr 8132  df-le 8133  df-sub 8265  df-neg 8266  df-reap 8668  df-ap 8675  df-div 8766  df-inn 9057  df-n0 9316  df-z 9393  df-q 9761  df-rp 9796  df-ico 10036  df-fl 10435  df-mod 10490

This theorem is referenced by:  modqmuladdim  10534