Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dvdsnegb | Structured version Visualization version GIF version |
Description: An integer divides another iff it divides its negation. (Contributed by Paul Chapman, 21-Mar-2011.) |
Ref | Expression |
---|---|
dvdsnegb | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ 𝑀 ∥ -𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
2 | znegcl 12005 | . . . 4 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
3 | 2 | anim2i 616 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ -𝑁 ∈ ℤ)) |
4 | znegcl 12005 | . . . 4 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
5 | 4 | adantl 482 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → -𝑥 ∈ ℤ) |
6 | zcn 11974 | . . . . 5 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
7 | zcn 11974 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
8 | mulneg1 11064 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (-𝑥 · 𝑀) = -(𝑥 · 𝑀)) | |
9 | negeq 10866 | . . . . . . 7 ⊢ ((𝑥 · 𝑀) = 𝑁 → -(𝑥 · 𝑀) = -𝑁) | |
10 | 9 | eqeq2d 2829 | . . . . . 6 ⊢ ((𝑥 · 𝑀) = 𝑁 → ((-𝑥 · 𝑀) = -(𝑥 · 𝑀) ↔ (-𝑥 · 𝑀) = -𝑁)) |
11 | 8, 10 | syl5ibcom 246 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((𝑥 · 𝑀) = 𝑁 → (-𝑥 · 𝑀) = -𝑁)) |
12 | 6, 7, 11 | syl2anr 596 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = 𝑁 → (-𝑥 · 𝑀) = -𝑁)) |
13 | 12 | adantlr 711 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = 𝑁 → (-𝑥 · 𝑀) = -𝑁)) |
14 | 1, 3, 5, 13 | dvds1lem 15609 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → 𝑀 ∥ -𝑁)) |
15 | zcn 11974 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
16 | negeq 10866 | . . . . . . . . . 10 ⊢ ((𝑥 · 𝑀) = -𝑁 → -(𝑥 · 𝑀) = --𝑁) | |
17 | negneg 10924 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℂ → --𝑁 = 𝑁) | |
18 | 16, 17 | sylan9eqr 2875 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℂ ∧ (𝑥 · 𝑀) = -𝑁) → -(𝑥 · 𝑀) = 𝑁) |
19 | 8, 18 | sylan9eq 2873 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) ∧ (𝑁 ∈ ℂ ∧ (𝑥 · 𝑀) = -𝑁)) → (-𝑥 · 𝑀) = 𝑁) |
20 | 19 | expr 457 | . . . . . . 7 ⊢ (((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) ∧ 𝑁 ∈ ℂ) → ((𝑥 · 𝑀) = -𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
21 | 20 | 3impa 1102 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → ((𝑥 · 𝑀) = -𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
22 | 6, 7, 15, 21 | syl3an 1152 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑥 · 𝑀) = -𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
23 | 22 | 3coml 1119 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = -𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
24 | 23 | 3expa 1110 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = -𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
25 | 3, 1, 5, 24 | dvds1lem 15609 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ -𝑁 → 𝑀 ∥ 𝑁)) |
26 | 14, 25 | impbid 213 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ 𝑀 ∥ -𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 class class class wbr 5057 (class class class)co 7145 ℂcc 10523 · cmul 10530 -cneg 10859 ℤcz 11969 ∥ cdvds 15595 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-ltxr 10668 df-sub 10860 df-neg 10861 df-nn 11627 df-z 11970 df-dvds 15596 |
This theorem is referenced by: dvdsabsb 15617 dvdssub 15642 dvdsadd2b 15644 3dvds 15668 bitscmp 15775 gcdneg 15858 prmdiv 16110 pcneg 16198 znunit 20638 2sqblem 25934 ex-mod 28155 congsym 39443 etransclem9 42405 |
Copyright terms: Public domain | W3C validator |