Theorem dvdsnegb 12575

Description: An integer divides another iff it divides its negation. (Contributed by Paul Chapman, 21-Mar-2011.)

Assertion

Ref	Expression
dvdsnegb	|- ( ( M e. ZZ /\ N e. ZZ ) -> ( M || N <-> M || -u N ) )

Proof of Theorem dvdsnegb

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 19	. . 3 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M e. ZZ /\ N e. ZZ ) )
2		znegcl 9675	. . . 4 |- ( N e. ZZ -> -u N e. ZZ )
3	2	anim2i 342	. . 3 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M e. ZZ /\ -u N e. ZZ ) )
4		znegcl 9675	. . . 4 |- ( x e. ZZ -> -u x e. ZZ )
5	4	adantl 277	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> -u x e. ZZ )
6		zcn 9649	. . . . 5 |- ( x e. ZZ -> x e. CC )
7		zcn 9649	. . . . 5 |- ( M e. ZZ -> M e. CC )
8		mulneg1 8722	. . . . . 6 |- ( ( x e. CC /\ M e. CC ) -> ( -u x x. M ) = -u ( x x. M ) )
9		negeq 8519	. . . . . . 7 |- ( ( x x. M ) = N -> -u ( x x. M ) = -u N )
10	9	eqeq2d 2250	. . . . . 6 |- ( ( x x. M ) = N -> ( ( -u x x. M ) = -u ( x x. M ) <-> ( -u x x. M ) = -u N ) )
11	8, 10	syl5ibcom 155	. . . . 5 |- ( ( x e. CC /\ M e. CC ) -> ( ( x x. M ) = N -> ( -u x x. M ) = -u N ) )
12	6, 7, 11	syl2anr 290	. . . 4 |- ( ( M e. ZZ /\ x e. ZZ ) -> ( ( x x. M ) = N -> ( -u x x. M ) = -u N ) )
13	12	adantlr 481	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> ( ( x x. M ) = N -> ( -u x x. M ) = -u N ) )
14	1, 3, 5, 13	dvds1lem 12569	. 2 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M || N -> M || -u N ) )
15		zcn 9649	. . . . . 6 |- ( N e. ZZ -> N e. CC )
16		negeq 8519	. . . . . . . . . 10 |- ( ( x x. M ) = -u N -> -u ( x x. M ) = -u -u N )
17		negneg 8576	. . . . . . . . . 10 |- ( N e. CC -> -u -u N = N )
18	16, 17	sylan9eqr 2293	. . . . . . . . 9 |- ( ( N e. CC /\ ( x x. M ) = -u N ) -> -u ( x x. M ) = N )
19	8, 18	sylan9eq 2291	. . . . . . . 8 |- ( ( ( x e. CC /\ M e. CC ) /\ ( N e. CC /\ ( x x. M ) = -u N ) ) -> ( -u x x. M ) = N )
20	19	expr 375	. . . . . . 7 |- ( ( ( x e. CC /\ M e. CC ) /\ N e. CC ) -> ( ( x x. M ) = -u N -> ( -u x x. M ) = N ) )
21	20	3impa 1225	. . . . . 6 |- ( ( x e. CC /\ M e. CC /\ N e. CC ) -> ( ( x x. M ) = -u N -> ( -u x x. M ) = N ) )
22	6, 7, 15, 21	syl3an 1320	. . . . 5 |- ( ( x e. ZZ /\ M e. ZZ /\ N e. ZZ ) -> ( ( x x. M ) = -u N -> ( -u x x. M ) = N ) )
23	22	3coml 1241	. . . 4 |- ( ( M e. ZZ /\ N e. ZZ /\ x e. ZZ ) -> ( ( x x. M ) = -u N -> ( -u x x. M ) = N ) )
24	23	3expa 1234	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ x e. ZZ ) -> ( ( x x. M ) = -u N -> ( -u x x. M ) = N ) )
25	3, 1, 5, 24	dvds1lem 12569	. 2 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M || -u N -> M || N ) )
26	14, 25	impbid 129	1 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M || N <-> M || -u N ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   x. cmul 8184   -ucneg 8498   ZZcz 9644   || 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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  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-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  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-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-z 9645  df-dvds 12555

This theorem is used by:  dvdsabsb  12577  dvdssub  12605  dvdsadd2b  12607  3dvds  12631  bitscmp  12725  gcdneg  12759  bezoutlemaz  12780  bezoutlembz  12781  prmdiv  13013  pcneg  13104  znunit  14994