Theorem divalgmod 12694

Description: The result of the mod operator satisfies the requirements for the remainder R in the division algorithm for a positive divisor (compare divalg2 12693 and divalgb 12692). This demonstration theorem justifies the use of mod to yield an explicit remainder from this point forward. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by AV, 21-Aug-2021.)

Assertion

Ref	Expression
divalgmod	|- ( ( N e. ZZ /\ D e. NN ) -> ( R = ( N mod D ) <-> ( R e. NN0 /\ ( R < D /\ D || ( N - R ) ) ) ) )

Proof of Theorem divalgmod

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		zq 10026	. . . . . . . 8 |- ( N e. ZZ -> N e. QQ )
2	1	adantr 276	. . . . . . 7 |- ( ( N e. ZZ /\ D e. NN ) -> N e. QQ )
3		nnq 10033	. . . . . . . 8 |- ( D e. NN -> D e. QQ )
4	3	adantl 277	. . . . . . 7 |- ( ( N e. ZZ /\ D e. NN ) -> D e. QQ )
5		simpr 110	. . . . . . . 8 |- ( ( N e. ZZ /\ D e. NN ) -> D e. NN )
6	5	nngt0d 9348	. . . . . . 7 |- ( ( N e. ZZ /\ D e. NN ) -> 0 < D )
7	2, 4, 6	modqcld 10765	. . . . . 6 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. QQ )
8		snidg 3738	. . . . . 6 |- ( ( N mod D ) e. QQ -> ( N mod D ) e. { ( N mod D ) } )
9	7, 8	syl 14	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. { ( N mod D ) } )
10		eleq1 2301	. . . . 5 |- ( R = ( N mod D ) -> ( R e. { ( N mod D ) } <-> ( N mod D ) e. { ( N mod D ) } ) )
11	9, 10	syl5ibrcom 157	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> ( R = ( N mod D ) -> R e. { ( N mod D ) } ) )
12		elsni 3727	. . . 4 |- ( R e. { ( N mod D ) } -> R = ( N mod D ) )
13	11, 12	impbid1 142	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( R = ( N mod D ) <-> R e. { ( N mod D ) } ) )
14		modqlt 10770	. . . . . . . . 9 |- ( ( N e. QQ /\ D e. QQ /\ 0 < D ) -> ( N mod D ) < D )
15	2, 4, 6, 14	syl3anc 1278	. . . . . . . 8 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) < D )
16		znq 10024	. . . . . . . . . 10 |- ( ( N e. ZZ /\ D e. NN ) -> ( N / D ) e. QQ )
17	16	flqcld 10712	. . . . . . . . 9 |- ( ( N e. ZZ /\ D e. NN ) -> ( |_ ` ( N / D ) ) e. ZZ )
18		nnz 9663	. . . . . . . . . 10 |- ( D e. NN -> D e. ZZ )
19	18	adantl 277	. . . . . . . . 9 |- ( ( N e. ZZ /\ D e. NN ) -> D e. ZZ )
20		zmodcl 10781	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. NN0 )
21	20	nn0zd 9766	. . . . . . . . . 10 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. ZZ )
22		zsubcl 9685	. . . . . . . . . 10 |- ( ( N e. ZZ /\ ( N mod D ) e. ZZ ) -> ( N - ( N mod D ) ) e. ZZ )
23	21, 22	syldan 282	. . . . . . . . 9 |- ( ( N e. ZZ /\ D e. NN ) -> ( N - ( N mod D ) ) e. ZZ )
24		nncn 9312	. . . . . . . . . . . 12 |- ( D e. NN -> D e. CC )
25	24	adantl 277	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ D e. NN ) -> D e. CC )
26	17	zcnd 9769	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ D e. NN ) -> ( |_ ` ( N / D ) ) e. CC )
27	25, 26	mulcomd 8347	. . . . . . . . . 10 |- ( ( N e. ZZ /\ D e. NN ) -> ( D x. ( |_ ` ( N / D ) ) ) = ( ( |_ ` ( N / D ) ) x. D ) )
28		modqval 10761	. . . . . . . . . . . 12 |- ( ( N e. QQ /\ D e. QQ /\ 0 < D ) -> ( N mod D ) = ( N - ( D x. ( |_ ` ( N / D ) ) ) ) )
29	2, 4, 6, 28	syl3anc 1278	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) = ( N - ( D x. ( |_ ` ( N / D ) ) ) ) )
30	20	nn0cnd 9622	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) e. CC )
31		zmulcl 9698	. . . . . . . . . . . . . 14 |- ( ( D e. ZZ /\ ( |_ ` ( N / D ) ) e. ZZ ) -> ( D x. ( |_ ` ( N / D ) ) ) e. ZZ )
32	18, 17, 31	syl2an2 602	. . . . . . . . . . . . 13 |- ( ( N e. ZZ /\ D e. NN ) -> ( D x. ( |_ ` ( N / D ) ) ) e. ZZ )
33	32	zcnd 9769	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ D e. NN ) -> ( D x. ( |_ ` ( N / D ) ) ) e. CC )
34		zcn 9649	. . . . . . . . . . . . 13 |- ( N e. ZZ -> N e. CC )
35	34	adantr 276	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ D e. NN ) -> N e. CC )
36	30, 33, 35	subexsub 8698	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( N mod D ) = ( N - ( D x. ( |_ ` ( N / D ) ) ) ) <-> ( D x. ( |_ ` ( N / D ) ) ) = ( N - ( N mod D ) ) ) )
37	29, 36	mpbid 147	. . . . . . . . . 10 |- ( ( N e. ZZ /\ D e. NN ) -> ( D x. ( |_ ` ( N / D ) ) ) = ( N - ( N mod D ) ) )
38	27, 37	eqtr3d 2273	. . . . . . . . 9 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( |_ ` ( N / D ) ) x. D ) = ( N - ( N mod D ) ) )
39		dvds0lem 12568	. . . . . . . . 9 |- ( ( ( ( |_ ` ( N / D ) ) e. ZZ /\ D e. ZZ /\ ( N - ( N mod D ) ) e. ZZ ) /\ ( ( |_ ` ( N / D ) ) x. D ) = ( N - ( N mod D ) ) ) -> D || ( N - ( N mod D ) ) )
40	17, 19, 23, 38, 39	syl31anc 1281	. . . . . . . 8 |- ( ( N e. ZZ /\ D e. NN ) -> D || ( N - ( N mod D ) ) )
41		divalg2 12693	. . . . . . . . 9 |- ( ( N e. ZZ /\ D e. NN ) -> E! z e. NN0 ( z < D /\ D || ( N - z ) ) )
42		breq1 4133	. . . . . . . . . . 11 |- ( z = ( N mod D ) -> ( z < D <-> ( N mod D ) < D ) )
43		oveq2 6093	. . . . . . . . . . . 12 |- ( z = ( N mod D ) -> ( N - z ) = ( N - ( N mod D ) ) )
44	43	breq2d 4142	. . . . . . . . . . 11 |- ( z = ( N mod D ) -> ( D || ( N - z ) <-> D || ( N - ( N mod D ) ) ) )
45	42, 44	anbi12d 477	. . . . . . . . . 10 |- ( z = ( N mod D ) -> ( ( z < D /\ D || ( N - z ) ) <-> ( ( N mod D ) < D /\ D || ( N - ( N mod D ) ) ) ) )
46	45	riota2 6062	. . . . . . . . 9 |- ( ( ( N mod D ) e. NN0 /\ E! z e. NN0 ( z < D /\ D || ( N - z ) ) ) -> ( ( ( N mod D ) < D /\ D || ( N - ( N mod D ) ) ) <-> ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) = ( N mod D ) ) )
47	20, 41, 46	syl2anc 415	. . . . . . . 8 |- ( ( N e. ZZ /\ D e. NN ) -> ( ( ( N mod D ) < D /\ D || ( N - ( N mod D ) ) ) <-> ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) = ( N mod D ) ) )
48	15, 40, 47	mpbi2and 956	. . . . . . 7 |- ( ( N e. ZZ /\ D e. NN ) -> ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) = ( N mod D ) )
49	48	eqcomd 2244	. . . . . 6 |- ( ( N e. ZZ /\ D e. NN ) -> ( N mod D ) = ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) )
50	49	sneqd 3722	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> { ( N mod D ) } = { ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) } )
51		snriota 6070	. . . . . 6 |- ( E! z e. NN0 ( z < D /\ D || ( N - z ) ) -> { z e. NN0 | ( z < D /\ D || ( N - z ) ) } = { ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) } )
52	41, 51	syl 14	. . . . 5 |- ( ( N e. ZZ /\ D e. NN ) -> { z e. NN0 | ( z < D /\ D || ( N - z ) ) } = { ( iota_ z e. NN0 ( z < D /\ D || ( N - z ) ) ) } )
53	50, 52	eqtr4d 2274	. . . 4 |- ( ( N e. ZZ /\ D e. NN ) -> { ( N mod D ) } = { z e. NN0 | ( z < D /\ D || ( N - z ) ) } )
54	53	eleq2d 2308	. . 3 |- ( ( N e. ZZ /\ D e. NN ) -> ( R e. { ( N mod D ) } <-> R e. { z e. NN0 | ( z < D /\ D || ( N - z ) ) } ) )
55	13, 54	bitrd 188	. 2 |- ( ( N e. ZZ /\ D e. NN ) -> ( R = ( N mod D ) <-> R e. { z e. NN0 | ( z < D /\ D || ( N - z ) ) } ) )
56		breq1 4133	. . . 4 |- ( z = R -> ( z < D <-> R < D ) )
57		oveq2 6093	. . . . 5 |- ( z = R -> ( N - z ) = ( N - R ) )
58	57	breq2d 4142	. . . 4 |- ( z = R -> ( D || ( N - z ) <-> D || ( N - R ) ) )
59	56, 58	anbi12d 477	. . 3 |- ( z = R -> ( ( z < D /\ D || ( N - z ) ) <-> ( R < D /\ D || ( N - R ) ) ) )
60	59	elrab 2982	. 2 |- ( R e. { z e. NN0 | ( z < D /\ D || ( N - z ) ) } <-> ( R e. NN0 /\ ( R < D /\ D || ( N - R ) ) ) )
61	55, 60	bitrdi 196	1 |- ( ( N e. ZZ /\ D e. NN ) -> ( R = ( N mod D ) <-> ( R e. NN0 /\ ( R < D /\ D || ( N - R ) ) ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   E!wreu 2530   {crab 2532   {csn 3709   class class class wbr 4130   ` cfv 5377   iota_crio 6037  (class class class)co 6085   CCcc 8177   0cc0 8179   x. cmul 8184   < clt 8360   - cmin 8497   / cdiv 9002   NNcn 9304   NN0cn0 9563   ZZcz 9644   QQcq 10019   |_cfl 10703   mod cmo 10759   || cdvds 12554

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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  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-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 3639  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-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  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-2 9363  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-fl 10705  df-mod 10760  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-dvds 12555

This theorem is used by:  divalgmodcl  12695