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 989 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) | |
2 | 3simpb 990 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
3 | zsubcl 9253 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − 𝑁) ∈ ℤ) | |
4 | 3 | anim2i 340 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐾 ∈ ℤ ∧ (𝑀 − 𝑁) ∈ ℤ)) |
5 | 4 | 3impb 1194 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ (𝑀 − 𝑁) ∈ ℤ)) |
6 | zsubcl 9253 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 − 𝑦) ∈ ℤ) | |
7 | 6 | adantl 275 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 − 𝑦) ∈ ℤ) |
8 | zcn 9217 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
9 | zcn 9217 | . . . . . . . 8 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
10 | zcn 9217 | . . . . . . . 8 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
11 | subdir 8305 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝐾 ∈ ℂ) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) | |
12 | 8, 9, 10, 11 | syl3an 1275 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) |
13 | 12 | 3comr 1206 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) |
14 | 13 | 3expb 1199 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 − 𝑦) · 𝐾) = ((𝑥 · 𝐾) − (𝑦 · 𝐾))) |
15 | oveq12 5862 | . . . . 5 ⊢ (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑥 · 𝐾) − (𝑦 · 𝐾)) = (𝑀 − 𝑁)) | |
16 | 14, 15 | sylan9eq 2223 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) ∧ ((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁)) → ((𝑥 − 𝑦) · 𝐾) = (𝑀 − 𝑁)) |
17 | 16 | ex 114 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑥 − 𝑦) · 𝐾) = (𝑀 − 𝑁))) |
18 | 17 | 3ad2antl1 1154 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑥 − 𝑦) · 𝐾) = (𝑀 − 𝑁))) |
19 | 1, 2, 5, 7, 18 | dvds2lem 11765 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ (𝑀 − 𝑁))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 973 = wceq 1348 ∈ wcel 2141 class class class wbr 3989 (class class class)co 5853 ℂcc 7772 · cmul 7779 − cmin 8090 ℤcz 9212 ∥ cdvds 11749 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-0id 7882 ax-rnegex 7883 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-ltadd 7890 |
This theorem depends on definitions: df-bi 116 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rab 2457 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-br 3990 df-opab 4051 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-iota 5160 df-fun 5200 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-inn 8879 df-n0 9136 df-z 9213 df-dvds 11750 |
This theorem is referenced by: dvds2subd 11789 dvdssub2 11797 difsqpwdvds 12291 |
Copyright terms: Public domain | W3C validator |