Theorem modifeq2int 10649

Description: If a nonnegative integer is less than twice a positive integer, the nonnegative integer modulo the positive integer equals the nonnegative integer or the nonnegative integer minus the positive integer. (Contributed by Alexander van der Vekens, 21-May-2018.)

Assertion

Ref	Expression
modifeq2int	|- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> ( A mod B ) = if ( A < B , A , ( A - B ) ) )

Proof of Theorem modifeq2int

Step	Hyp	Ref	Expression
1		simp1 1023	. . . . . 6 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> A e. NN0 )
2		nn0z 9499	. . . . . . 7 |- ( A e. NN0 -> A e. ZZ )
3		zq 9860	. . . . . . 7 |- ( A e. ZZ -> A e. QQ )
4	2, 3	syl 14	. . . . . 6 |- ( A e. NN0 -> A e. QQ )
5	1, 4	syl 14	. . . . 5 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> A e. QQ )
6	5	adantr 276	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> A e. QQ )
7		nnq 9867	. . . . . 6 |- ( B e. NN -> B e. QQ )
8	7	3ad2ant2 1045	. . . . 5 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> B e. QQ )
9	8	adantr 276	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> B e. QQ )
10	1	nn0ge0d 9458	. . . . 5 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> 0 <_ A )
11	10	adantr 276	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> 0 <_ A )
12		simpr 110	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> A < B )
13		modqid 10612	. . . 4 |- ( ( ( A e. QQ /\ B e. QQ ) /\ ( 0 <_ A /\ A < B ) ) -> ( A mod B ) = A )
14	6, 9, 11, 12, 13	syl22anc 1274	. . 3 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> ( A mod B ) = A )
15		iftrue 3610	. . . . 5 |- ( A < B -> if ( A < B , A , ( A - B ) ) = A )
16	15	eqcomd 2237	. . . 4 |- ( A < B -> A = if ( A < B , A , ( A - B ) ) )
17	16	adantl 277	. . 3 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> A = if ( A < B , A , ( A - B ) ) )
18	14, 17	eqtrd 2264	. 2 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ A < B ) -> ( A mod B ) = if ( A < B , A , ( A - B ) ) )
19	5	adantr 276	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> A e. QQ )
20	8	adantr 276	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> B e. QQ )
21		simp2 1024	. . . . . 6 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> B e. NN )
22	21	adantr 276	. . . . 5 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> B e. NN )
23	22	nngt0d 9187	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> 0 < B )
24	21	nnred 9156	. . . . . 6 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> B e. RR )
25	1	nn0red 9456	. . . . . 6 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> A e. RR )
26	24, 25	lenltd 8297	. . . . 5 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> ( B <_ A <-> -. A < B ) )
27	26	biimpar 297	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> B <_ A )
28		simpl3 1028	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> A < ( 2 x. B ) )
29		q2submod 10648	. . . 4 |- ( ( ( A e. QQ /\ B e. QQ /\ 0 < B ) /\ ( B <_ A /\ A < ( 2 x. B ) ) ) -> ( A mod B ) = ( A - B ) )
30	19, 20, 23, 27, 28, 29	syl32anc 1281	. . 3 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> ( A mod B ) = ( A - B ) )
31		iffalse 3613	. . . . 5 |- ( -. A < B -> if ( A < B , A , ( A - B ) ) = ( A - B ) )
32	31	adantl 277	. . . 4 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> if ( A < B , A , ( A - B ) ) = ( A - B ) )
33	32	eqcomd 2237	. . 3 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> ( A - B ) = if ( A < B , A , ( A - B ) ) )
34	30, 33	eqtrd 2264	. 2 |- ( ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) /\ -. A < B ) -> ( A mod B ) = if ( A < B , A , ( A - B ) ) )
35	1, 2	syl 14	. . 3 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> A e. ZZ )
36	21	nnzd 9601	. . 3 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> B e. ZZ )
37		zdclt 9557	. . . 4 |- ( ( A e. ZZ /\ B e. ZZ ) -> DECID A < B )
38		exmiddc 843	. . . 4 |- (DECID A < B -> ( A < B \/ -. A < B ) )
39	37, 38	syl 14	. . 3 |- ( ( A e. ZZ /\ B e. ZZ ) -> ( A < B \/ -. A < B ) )
40	35, 36, 39	syl2anc 411	. 2 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> ( A < B \/ -. A < B ) )
41	18, 34, 40	mpjaodan 805	1 |- ( ( A e. NN0 /\ B e. NN /\ A < ( 2 x. B ) ) -> ( A mod B ) = if ( A < B , A , ( A - B ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 715  DECID wdc 841   /\ w3a 1004   = wceq 1397   e. wcel 2202   ifcif 3605   class class class wbr 4088  (class class class)co 6018   0cc0 8032   x. cmul 8037   < clt 8214   <_ cle 8215   - cmin 8350   NNcn 9143   2c2 9194   NN0cn0 9402   ZZcz 9479   QQcq 9853   mod cmo 10585

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150  ax-arch 8151

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-2 9202  df-n0 9403  df-z 9480  df-q 9854  df-rp 9889  df-fl 10531  df-mod 10586

This theorem is referenced by: (None)