| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dvdssub2 | GIF version | ||
| Description: If an integer divides a difference, then it divides one term iff it divides the other. (Contributed by Mario Carneiro, 13-Jul-2014.) |
| Ref | Expression |
|---|---|
| dvdssub2 | ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∥ (𝑀 − 𝑁)) → (𝐾 ∥ 𝑀 ↔ 𝐾 ∥ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zsubcl 9696 | . . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − 𝑁) ∈ ℤ) | |
| 2 | 1 | 3adant1 1046 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − 𝑁) ∈ ℤ) |
| 3 | dvds2sub 12618 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ (𝑀 − 𝑁) ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝐾 ∥ (𝑀 − 𝑁)) → 𝐾 ∥ (𝑀 − (𝑀 − 𝑁)))) | |
| 4 | 2, 3 | syld3an3 1323 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝐾 ∥ (𝑀 − 𝑁)) → 𝐾 ∥ (𝑀 − (𝑀 − 𝑁)))) |
| 5 | 4 | ancomsd 269 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑀) → 𝐾 ∥ (𝑀 − (𝑀 − 𝑁)))) |
| 6 | 5 | imp 124 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑀)) → 𝐾 ∥ (𝑀 − (𝑀 − 𝑁))) |
| 7 | zcn 9660 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 8 | zcn 9660 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 9 | nncan 8562 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝑀 − (𝑀 − 𝑁)) = 𝑁) | |
| 10 | 7, 8, 9 | syl2an 289 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − (𝑀 − 𝑁)) = 𝑁) |
| 11 | 10 | 3adant1 1046 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − (𝑀 − 𝑁)) = 𝑁) |
| 12 | 11 | adantr 276 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑀)) → (𝑀 − (𝑀 − 𝑁)) = 𝑁) |
| 13 | 6, 12 | breqtrd 4157 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑀)) → 𝐾 ∥ 𝑁) |
| 14 | 13 | expr 375 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∥ (𝑀 − 𝑁)) → (𝐾 ∥ 𝑀 → 𝐾 ∥ 𝑁)) |
| 15 | dvds2add 12617 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ (𝑀 − 𝑁) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ ((𝑀 − 𝑁) + 𝑁))) | |
| 16 | 2, 15 | syld3an2 1325 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ ((𝑀 − 𝑁) + 𝑁))) |
| 17 | 16 | imp 124 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑁)) → 𝐾 ∥ ((𝑀 − 𝑁) + 𝑁)) |
| 18 | npcan 8542 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → ((𝑀 − 𝑁) + 𝑁) = 𝑀) | |
| 19 | 7, 8, 18 | syl2an 289 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 𝑁) + 𝑁) = 𝑀) |
| 20 | 19 | 3adant1 1046 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 𝑁) + 𝑁) = 𝑀) |
| 21 | 20 | adantr 276 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑁)) → ((𝑀 − 𝑁) + 𝑁) = 𝑀) |
| 22 | 17, 21 | breqtrd 4157 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∥ (𝑀 − 𝑁) ∧ 𝐾 ∥ 𝑁)) → 𝐾 ∥ 𝑀) |
| 23 | 22 | expr 375 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∥ (𝑀 − 𝑁)) → (𝐾 ∥ 𝑁 → 𝐾 ∥ 𝑀)) |
| 24 | 14, 23 | impbid 129 | 1 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝐾 ∥ (𝑀 − 𝑁)) → (𝐾 ∥ 𝑀 ↔ 𝐾 ∥ 𝑁)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 class class class wbr 4131 (class class class)co 6088 ℂcc 8183 + caddc 8188 − cmin 8504 ℤcz 9655 ∥ cdvds 12579 |
| 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 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| 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 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-dvds 12580 |
| This theorem is used by: dvdsadd 12628 3dvds 12656 bitsmod 12748 bitsinv1lem 12753 znunit 15103 perfectlem1 16299 2sqlem8 16447 |
| Copyright terms: Public domain | W3C validator |