| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > negdvdsb | 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 19 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 2 | znegcl 9423 | . . . 4 ⊢ (𝑀 ∈ ℤ → -𝑀 ∈ ℤ) | |
| 3 | 2 | anim1i 340 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (-𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
| 4 | znegcl 9423 | . . . 4 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ) | |
| 5 | 4 | adantl 277 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → -𝑥 ∈ ℤ) |
| 6 | zcn 9397 | . . . . . . 7 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 7 | zcn 9397 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 8 | mul2neg 8490 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (-𝑥 · -𝑀) = (𝑥 · 𝑀)) | |
| 9 | 6, 7, 8 | syl2anr 290 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (-𝑥 · -𝑀) = (𝑥 · 𝑀)) |
| 10 | 9 | adantlr 477 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (-𝑥 · -𝑀) = (𝑥 · 𝑀)) |
| 11 | 10 | eqeq1d 2215 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((-𝑥 · -𝑀) = 𝑁 ↔ (𝑥 · 𝑀) = 𝑁)) |
| 12 | 11 | biimprd 158 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = 𝑁 → (-𝑥 · -𝑀) = 𝑁)) |
| 13 | 1, 3, 5, 12 | dvds1lem 12188 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → -𝑀 ∥ 𝑁)) |
| 14 | mulneg12 8489 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (-𝑥 · 𝑀) = (𝑥 · -𝑀)) | |
| 15 | 6, 7, 14 | syl2anr 290 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (-𝑥 · 𝑀) = (𝑥 · -𝑀)) |
| 16 | 15 | adantlr 477 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (-𝑥 · 𝑀) = (𝑥 · -𝑀)) |
| 17 | 16 | eqeq1d 2215 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((-𝑥 · 𝑀) = 𝑁 ↔ (𝑥 · -𝑀) = 𝑁)) |
| 18 | 17 | biimprd 158 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · -𝑀) = 𝑁 → (-𝑥 · 𝑀) = 𝑁)) |
| 19 | 3, 1, 5, 18 | dvds1lem 12188 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (-𝑀 ∥ 𝑁 → 𝑀 ∥ 𝑁)) |
| 20 | 13, 19 | impbid 129 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ -𝑀 ∥ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2177 class class class wbr 4051 (class class class)co 5957 ℂcc 7943 · cmul 7950 -cneg 8264 ℤcz 9392 ∥ cdvds 12173 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4170 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-addcom 8045 ax-mulcom 8046 ax-addass 8047 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-0id 8053 ax-rnegex 8054 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-ltadd 8061 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-int 3892 df-br 4052 df-opab 4114 df-id 4348 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-iota 5241 df-fun 5282 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-inn 9057 df-z 9393 df-dvds 12174 |
| This theorem is referenced by: absdvdsb 12195 zdvdsdc 12198 3dvds 12250 bezoutlemzz 12398 lcmneg 12471 |
| Copyright terms: Public domain | W3C validator |