Theorem divalglemnn 12059

Description: Lemma for divalg 12065. Existence for a positive denominator. (Contributed by Jim Kingdon, 30-Nov-2021.)

Assertion

Ref	Expression
divalglemnn	|- ( ( N e. ZZ /\ D e. NN ) -> E. r e. ZZ E. q e. ZZ ( 0 <_ r /\ r < ( abs ` D ) /\ N = ( ( q x. D ) + r ) ) )

Distinct variable groups:   D, q, r   N, q, r

Proof of Theorem divalglemnn

Step	Hyp	Ref	Expression
1		zmodcl 10415	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. NN0 )
2	1	nn0zd 9437	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. ZZ )
3		znq 9689	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N / D ) e. QQ )
4	3	flqcld 10346	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( |_ ` ( N / D ) ) e. ZZ )
5	1	nn0ge0d 9296	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> 0 <_ ( N mod D ) )
6		zq 9691	. . . . 5 |- ( N e. ZZ -> N e. QQ )
7	6	adantr 276	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> N e. QQ )
8		nnq 9698	. . . . 5 |- ( D e. NN -> D e. QQ )
9	8	adantl 277	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> D e. QQ )
10		nngt0 9007	. . . . 5 |- ( D e. NN -> 0 < D )
11	10	adantl 277	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> 0 < D )
12		modqlt 10404	. . . 4 |- ( ( N e. QQ /\ D e. QQ /\ 0 < D ) -> ( N mod D ) < D )
13	7, 9, 11, 12	syl3anc 1249	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) < D )
14		nnre 8989	. . . . 5 |- ( D e. NN -> D e. RR )
15	14	adantl 277	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> D e. RR )
16		0red 8020	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> 0 e. RR )
17	16, 15, 11	ltled 8138	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> 0 <_ D )
18	15, 17	absidd 11311	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( abs ` D ) = D )
19	13, 18	breqtrrd 4057	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) < ( abs ` D ) )
20	1	nn0cnd 9295	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. CC )
21	4	zcnd 9440	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> ( |_ ` ( N / D ) ) e. CC )
22		simpr 110	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> D e. NN )
23	22	nncnd 8996	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> D e. CC )
24	21, 23	mulcld 8040	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( |_ ` ( N / D ) ) x. D ) e. CC )
25		modqvalr 10396	. . . . . 6 |- ( ( N e. QQ /\ D e. QQ /\ 0 < D ) -> ( N mod D ) = ( N - ( ( |_ ` ( N / D ) ) x. D ) ) )
26	7, 9, 11, 25	syl3anc 1249	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) = ( N - ( ( |_ ` ( N / D ) ) x. D ) ) )
27	26	oveq1d 5933	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( N mod D ) + ( ( |_ ` ( N / D ) ) x. D ) ) = ( ( N - ( ( |_ ` ( N / D ) ) x. D ) ) + ( ( |_ ` ( N / D ) ) x. D ) ) )
28		simpl 109	. . . . . 6 |- ( ( N e. ZZ /\ D e. NN ) -> N e. ZZ )
29	28	zcnd 9440	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> N e. CC )
30	29, 24	npcand 8334	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( N - ( ( |_ ` ( N / D ) ) x. D ) ) + ( ( |_ ` ( N / D ) ) x. D ) ) = N )
31	27, 30	eqtr2d 2227	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> N = ( ( N mod D ) + ( ( |_ ` ( N / D ) ) x. D ) ) )
32	20, 24, 31	comraddd 8176	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> N = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) )
33		breq2 4033	. . . 4 |- ( r = ( N mod D ) -> ( 0 <_ r <-> 0 <_ ( N mod D ) ) )
34		breq1 4032	. . . 4 |- ( r = ( N mod D ) -> ( r < ( abs ` D ) <-> ( N mod D ) < ( abs ` D ) ) )
35		oveq2 5926	. . . . 5 |- ( r = ( N mod D ) -> ( ( q x. D ) + r ) = ( ( q x. D ) + ( N mod D ) ) )
36	35	eqeq2d 2205	. . . 4 |- ( r = ( N mod D ) -> ( N = ( ( q x. D ) + r ) <-> N = ( ( q x. D ) + ( N mod D ) ) ) )
37	33, 34, 36	3anbi123d 1323	. . 3 |- ( r = ( N mod D ) -> ( ( 0 <_ r /\ r < ( abs ` D ) /\ N = ( ( q x. D ) + r ) ) <-> ( 0 <_ ( N mod D ) /\ ( N mod D ) < ( abs ` D ) /\ N = ( ( q x. D ) + ( N mod D ) ) ) ) )
38		oveq1 5925	. . . . . 6 |- ( q = ( |_ ` ( N / D ) ) -> ( q x. D ) = ( ( |_ ` ( N / D ) ) x. D ) )
39	38	oveq1d 5933	. . . . 5 |- ( q = ( |_ ` ( N / D ) ) -> ( ( q x. D ) + ( N mod D ) ) = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) )
40	39	eqeq2d 2205	. . . 4 |- ( q = ( |_ ` ( N / D ) ) -> ( N = ( ( q x. D ) + ( N mod D ) ) <-> N = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) ) )
41	40	3anbi3d 1329	. . 3 |- ( q = ( |_ ` ( N / D ) ) -> ( ( 0 <_ ( N mod D ) /\ ( N mod D ) < ( abs ` D ) /\ N = ( ( q x. D ) + ( N mod D ) ) ) <-> ( 0 <_ ( N mod D ) /\ ( N mod D ) < ( abs ` D ) /\ N = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) ) ) )
42	37, 41	rspc2ev 2879	. 2 |- ( ( ( N mod D ) e. ZZ /\ ( |_ ` ( N / D ) ) e. ZZ /\ ( 0 <_ ( N mod D ) /\ ( N mod D ) < ( abs ` D ) /\ N = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) ) ) -> E. r e. ZZ E. q e. ZZ ( 0 <_ r /\ r < ( abs ` D ) /\ N = ( ( q x. D ) + r ) ) )
43	2, 4, 5, 19, 32, 42	syl113anc 1261	1 |- ( ( N e. ZZ /\ D e. NN ) -> E. r e. ZZ E. q e. ZZ ( 0 <_ r /\ r < ( abs ` D ) /\ N = ( ( q x. D ) + r ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 980   = wceq 1364   e. wcel 2164   E.wrex 2473   class class class wbr 4029   ` cfv 5254  (class class class)co 5918   RRcr 7871   0cc0 7872   + caddc 7875   x. cmul 7877   < clt 8054   <_ cle 8055   - cmin 8190   / cdiv 8691   NNcn 8982   ZZcz 9317   QQcq 9684   |_cfl 10337   mod cmo 10393   abscabs 11141

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990  ax-arch 7991

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-ilim 4400  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-frec 6444  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-2 9041  df-n0 9241  df-z 9318  df-uz 9593  df-q 9685  df-rp 9720  df-fl 10339  df-mod 10394  df-seqfrec 10519  df-exp 10610  df-cj 10986  df-re 10987  df-im 10988  df-rsqrt 11142  df-abs 11143

This theorem is referenced by:  divalglemeunn  12062  divalglemex  12063