Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dvds2sub | GIF version |
Description: If an integer divides each of two other integers, it divides their difference. (Contributed by Paul Chapman, 21-Mar-2011.) |
Ref | Expression |
---|---|
dvds2sub | ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ (𝑀 − 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3simpa 984 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) | |
2 | 3simpb 985 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
3 | zsubcl 9232 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − 𝑁) ∈ ℤ) | |
4 | 3 | anim2i 340 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐾 ∈ ℤ ∧ (𝑀 − 𝑁) ∈ ℤ)) |
5 | 4 | 3impb 1189 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ (𝑀 − 𝑁) ∈ ℤ)) |
6 | zsubcl 9232 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 − 𝑦) ∈ ℤ) | |
7 | 6 | adantl 275 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 − 𝑦) ∈ ℤ) |
8 | zcn 9196 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
9 | zcn 9196 | . . . . . . . 8 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
10 | zcn 9196 | . . . . . . . 8 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
11 | subdir 8284 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝐾 ∈ ℂ) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) | |
12 | 8, 9, 10, 11 | syl3an 1270 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) |
13 | 12 | 3comr 1201 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) |
14 | 13 | 3expb 1194 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) |
15 | oveq12 5851 | . . . . 5 ⊢ (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑥 · 𝐾) − (𝑦 · 𝐾)) = (𝑀 − 𝑁)) | |
16 | 14, 15 | sylan9eq 2219 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) ∧ ((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁)) → ((𝑥 − 𝑦) · 𝐾) = (𝑀 − 𝑁)) |
17 | 16 | ex 114 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑥 − 𝑦) · 𝐾) = (𝑀 − 𝑁))) |
18 | 17 | 3ad2antl1 1149 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑥 − 𝑦) · 𝐾) = (𝑀 − 𝑁))) |
19 | 1, 2, 5, 7, 18 | dvds2lem 11743 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ (𝑀 − 𝑁))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 class class class wbr 3982 (class class class)co 5842 ℂcc 7751 · cmul 7758 − cmin 8069 ℤcz 9191 ∥ cdvds 11727 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-0id 7861 ax-rnegex 7862 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-ltadd 7869 |
This theorem depends on definitions: df-bi 116 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rab 2453 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-br 3983 df-opab 4044 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-inn 8858 df-n0 9115 df-z 9192 df-dvds 11728 |
This theorem is referenced by: dvds2subd 11767 dvdssub2 11775 difsqpwdvds 12269 |
Copyright terms: Public domain | W3C validator |