Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > negdvdsb | Structured version Visualization version GIF version |
Description: An integer divides another iff its negation does. (Contributed by Paul Chapman, 21-Mar-2011.) |
Ref | Expression |
---|---|
negdvdsb | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ -𝑀 ∥ 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
2 | znegcl 11999 | . . . 4 ⊢ (𝑀 ∈ ℤ → -𝑀 ∈ ℤ) | |
3 | 2 | anim1i 616 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (-𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
4 | znegcl 11999 | . . . 4 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
5 | 4 | adantl 484 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → -𝑥 ∈ ℤ) |
6 | zcn 11968 | . . . . . . 7 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
7 | zcn 11968 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
8 | mul2neg 11060 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (-𝑥 · -𝑀) = (𝑥 · 𝑀)) | |
9 | 6, 7, 8 | syl2anr 598 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (-𝑥 · -𝑀) = (𝑥 · 𝑀)) |
10 | 9 | adantlr 713 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (-𝑥 · -𝑀) = (𝑥 · 𝑀)) |
11 | 10 | eqeq1d 2822 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((-𝑥 · -𝑀) = 𝑁 ↔ (𝑥 · 𝑀) = 𝑁)) |
12 | 11 | biimprd 250 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = 𝑁 → (-𝑥 · -𝑀) = 𝑁)) |
13 | 1, 3, 5, 12 | dvds1lem 15601 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → -𝑀 ∥ 𝑁)) |
14 | mulneg12 11059 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (-𝑥 · 𝑀) = (𝑥 · -𝑀)) | |
15 | 6, 7, 14 | syl2anr 598 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (-𝑥 · 𝑀) = (𝑥 · -𝑀)) |
16 | 15 | adantlr 713 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (-𝑥 · 𝑀) = (𝑥 · -𝑀)) |
17 | 16 | eqeq1d 2822 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((-𝑥 · 𝑀) = 𝑁 ↔ (𝑥 · -𝑀) = 𝑁)) |
18 | 17 | biimprd 250 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · -𝑀) = 𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
19 | 3, 1, 5, 18 | dvds1lem 15601 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (-𝑀 ∥ 𝑁 → 𝑀 ∥ 𝑁)) |
20 | 13, 19 | impbid 214 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ -𝑀 ∥ 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 class class class wbr 5047 (class class class)co 7137 ℂcc 10516 · cmul 10523 -cneg 10852 ℤcz 11963 ∥ cdvds 15587 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2792 ax-sep 5184 ax-nul 5191 ax-pow 5247 ax-pr 5311 ax-un 7442 ax-resscn 10575 ax-1cn 10576 ax-icn 10577 ax-addcl 10578 ax-addrcl 10579 ax-mulcl 10580 ax-mulrcl 10581 ax-mulcom 10582 ax-addass 10583 ax-mulass 10584 ax-distr 10585 ax-i2m1 10586 ax-1ne0 10587 ax-1rid 10588 ax-rnegex 10589 ax-rrecex 10590 ax-cnre 10591 ax-pre-lttri 10592 ax-pre-lttrn 10593 ax-pre-ltadd 10594 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2891 df-nfc 2959 df-ne 3012 df-nel 3119 df-ral 3138 df-rex 3139 df-reu 3140 df-rab 3142 df-v 3483 df-sbc 3759 df-csb 3867 df-dif 3922 df-un 3924 df-in 3926 df-ss 3935 df-pss 3937 df-nul 4275 df-if 4449 df-pw 4522 df-sn 4549 df-pr 4551 df-tp 4553 df-op 4555 df-uni 4820 df-iun 4902 df-br 5048 df-opab 5110 df-mpt 5128 df-tr 5154 df-id 5441 df-eprel 5446 df-po 5455 df-so 5456 df-fr 5495 df-we 5497 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-riota 7095 df-ov 7140 df-oprab 7141 df-mpo 7142 df-om 7562 df-wrecs 7928 df-recs 7989 df-rdg 8027 df-er 8270 df-en 8491 df-dom 8492 df-sdom 8493 df-pnf 10658 df-mnf 10659 df-ltxr 10661 df-sub 10853 df-neg 10854 df-nn 11620 df-z 11964 df-dvds 15588 |
This theorem is referenced by: absdvdsb 15608 3dvds 15660 lcmneg 15925 |
Copyright terms: Public domain | W3C validator |