Theorem qnegmod 10135

Description: The negation of a number modulo a positive number is equal to the difference of the modulus and the number modulo the modulus. (Contributed by Jim Kingdon, 24-Oct-2021.)

Assertion

Ref	Expression
qnegmod	|- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( -u A mod N ) = ( ( N - A ) mod N ) )

Proof of Theorem qnegmod

Step	Hyp	Ref	Expression
1		qcn 9419	. . . . . 6 |- ( N e. QQ -> N e. CC )
2	1	3ad2ant2 1003	. . . . 5 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> N e. CC )
3		qcn 9419	. . . . . 6 |- ( A e. QQ -> A e. CC )
4	3	3ad2ant1 1002	. . . . 5 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> A e. CC )
5	2, 4	negsubd 8072	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( N + -u A ) = ( N - A ) )
6	5	eqcomd 2143	. . 3 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( N - A ) = ( N + -u A ) )
7	6	oveq1d 5782	. 2 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( N - A ) mod N ) = ( ( N + -u A ) mod N ) )
8	2	mulid2d 7777	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( 1 x. N ) = N )
9	8	oveq1d 5782	. . 3 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( 1 x. N ) + -u A ) = ( N + -u A ) )
10	9	oveq1d 5782	. 2 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( ( 1 x. N ) + -u A ) mod N ) = ( ( N + -u A ) mod N ) )
11		1cnd 7775	. . . . . 6 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> 1 e. CC )
12	11, 2	mulcld 7779	. . . . 5 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( 1 x. N ) e. CC )
13		qnegcl 9421	. . . . . . 7 |- ( A e. QQ -> -u A e. QQ )
14		qcn 9419	. . . . . . 7 |- ( -u A e. QQ -> -u A e. CC )
15	13, 14	syl 14	. . . . . 6 |- ( A e. QQ -> -u A e. CC )
16	15	3ad2ant1 1002	. . . . 5 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> -u A e. CC )
17	12, 16	addcomd 7906	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( 1 x. N ) + -u A ) = ( -u A + ( 1 x. N ) ) )
18	17	oveq1d 5782	. . 3 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( ( 1 x. N ) + -u A ) mod N ) = ( ( -u A + ( 1 x. N ) ) mod N ) )
19	13	3ad2ant1 1002	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> -u A e. QQ )
20		1zzd 9074	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> 1 e. ZZ )
21		simp2 982	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> N e. QQ )
22		simp3 983	. . . 4 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> 0 < N )
23		modqcyc 10125	. . . 4 |- ( ( ( -u A e. QQ /\ 1 e. ZZ ) /\ ( N e. QQ /\ 0 < N ) ) -> ( ( -u A + ( 1 x. N ) ) mod N ) = ( -u A mod N ) )
24	19, 20, 21, 22, 23	syl22anc 1217	. . 3 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( -u A + ( 1 x. N ) ) mod N ) = ( -u A mod N ) )
25	18, 24	eqtrd 2170	. 2 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( ( ( 1 x. N ) + -u A ) mod N ) = ( -u A mod N ) )
26	7, 10, 25	3eqtr2rd 2177	1 |- ( ( A e. QQ /\ N e. QQ /\ 0 < N ) -> ( -u A mod N ) = ( ( N - A ) mod N ) )

Syntax hints:   -> wi 4   /\ w3a 962   = wceq 1331   e. wcel 1480   class class class wbr 3924  (class class class)co 5767   CCcc 7611   0cc0 7613   1c1 7614   + caddc 7616   x. cmul 7618   < clt 7793   - cmin 7926   -ucneg 7927   ZZcz 9047   QQcq 9404   mod cmo 10088

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-mulrcl 7712  ax-addcom 7713  ax-mulcom 7714  ax-addass 7715  ax-mulass 7716  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-1rid 7720  ax-0id 7721  ax-rnegex 7722  ax-precex 7723  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-apti 7728  ax-pre-ltadd 7729  ax-pre-mulgt0 7730  ax-pre-mulext 7731  ax-arch 7732

This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rmo 2422  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-po 4213  df-iso 4214  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-reap 8330  df-ap 8337  df-div 8426  df-inn 8714  df-n0 8971  df-z 9048  df-q 9405  df-rp 9435  df-fl 10036  df-mod 10089

This theorem is referenced by:  m1modnnsub1  10136