Theorem divalglemnn 12663

Description: Lemma for divalg 12669. 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 10759	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. NN0 )
2	1	nn0zd 9745	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. ZZ )
3		znq 10003	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N / D ) e. QQ )
4	3	flqcld 10690	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( |_ ` ( N / D ) ) e. ZZ )
5	1	nn0ge0d 9602	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> 0 <_ ( N mod D ) )
6		zq 10005	. . . . 5 |- ( N e. ZZ -> N e. QQ )
7	6	adantr 276	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> N e. QQ )
8		nnq 10012	. . . . 5 |- ( D e. NN -> D e. QQ )
9	8	adantl 277	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> D e. QQ )
10		nngt0 9308	. . . . 5 |- ( D e. NN -> 0 < D )
11	10	adantl 277	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> 0 < D )
12		modqlt 10748	. . . 4 |- ( ( N e. QQ /\ D e. QQ /\ 0 < D ) -> ( N mod D ) < D )
13	7, 9, 11, 12	syl3anc 1278	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) < D )
14		nnre 9290	. . . . 5 |- ( D e. NN -> D e. RR )
15	14	adantl 277	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> D e. RR )
16		0red 8317	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> 0 e. RR )
17	16, 15, 11	ltled 8435	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> 0 <_ D )
18	15, 17	absidd 11911	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( abs ` D ) = D )
19	13, 18	breqtrrd 4153	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) < ( abs ` D ) )
20	1	nn0cnd 9601	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. CC )
21	4	zcnd 9748	. . . 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 9297	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> D e. CC )
24	21, 23	mulcld 8336	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( |_ ` ( N / D ) ) x. D ) e. CC )
25		modqvalr 10740	. . . . . 6 |- ( ( N e. QQ /\ D e. QQ /\ 0 < D ) -> ( N mod D ) = ( N - ( ( |_ ` ( N / D ) ) x. D ) ) )
26	7, 9, 11, 25	syl3anc 1278	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) = ( N - ( ( |_ ` ( N / D ) ) x. D ) ) )
27	26	oveq1d 6090	. . . 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 9748	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> N e. CC )
30	29, 24	npcand 8631	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( N - ( ( |_ ` ( N / D ) ) x. D ) ) + ( ( |_ ` ( N / D ) ) x. D ) ) = N )
31	27, 30	eqtr2d 2272	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> N = ( ( N mod D ) + ( ( |_ ` ( N / D ) ) x. D ) ) )
32	20, 24, 31	comraddd 8473	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> N = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) )
33		breq2 4129	. . . 4 |- ( r = ( N mod D ) -> ( 0 <_ r <-> 0 <_ ( N mod D ) ) )
34		breq1 4128	. . . 4 |- ( r = ( N mod D ) -> ( r < ( abs ` D ) <-> ( N mod D ) < ( abs ` D ) ) )
35		oveq2 6083	. . . . 5 |- ( r = ( N mod D ) -> ( ( q x. D ) + r ) = ( ( q x. D ) + ( N mod D ) ) )
36	35	eqeq2d 2250	. . . 4 |- ( r = ( N mod D ) -> ( N = ( ( q x. D ) + r ) <-> N = ( ( q x. D ) + ( N mod D ) ) ) )
37	33, 34, 36	3anbi123d 1353	. . 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 6082	. . . . . 6 |- ( q = ( |_ ` ( N / D ) ) -> ( q x. D ) = ( ( |_ ` ( N / D ) ) x. D ) )
39	38	oveq1d 6090	. . . . 5 |- ( q = ( |_ ` ( N / D ) ) -> ( ( q x. D ) + ( N mod D ) ) = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) )
40	39	eqeq2d 2250	. . . 4 |- ( q = ( |_ ` ( N / D ) ) -> ( N = ( ( q x. D ) + ( N mod D ) ) <-> N = ( ( ( |_ ` ( N / D ) ) x. D ) + ( N mod D ) ) ) )
41	40	3anbi3d 1359	. . 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 2945	. 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 1290	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 1009   = wceq 1402   e. wcel 2209   E.wrex 2529   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   RRcr 8168   0cc0 8169   + caddc 8172   x. cmul 8174   < clt 8350   <_ cle 8351   - cmin 8487   / cdiv 8992   NNcn 9283   ZZcz 9623   QQcq 9998   |_cfl 10681   mod cmo 10737   abscabs 11741

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 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-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288

This theorem depends on definitions:  df-bi 117  df-dc 847  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-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-n0 9543  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-fl 10683  df-mod 10738  df-seqfrec 10863  df-exp 10954  df-cj 11585  df-re 11586  df-im 11587  df-rsqrt 11742  df-abs 11743

This theorem is referenced by:  divalglemeunn  12666  divalglemex  12667