![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dvdssubr | GIF version |
Description: An integer divides another iff it divides their difference. (Contributed by Paul Chapman, 31-Mar-2011.) |
Ref | Expression |
---|---|
dvdssubr | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ 𝑀 ∥ (𝑁 − 𝑀))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zsubcl 9270 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 − 𝑀) ∈ ℤ) | |
2 | 1 | ancoms 268 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 − 𝑀) ∈ ℤ) |
3 | dvdsadd 11814 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 𝑀) ∈ ℤ) → (𝑀 ∥ (𝑁 − 𝑀) ↔ 𝑀 ∥ (𝑀 + (𝑁 − 𝑀)))) | |
4 | 2, 3 | syldan 282 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ (𝑁 − 𝑀) ↔ 𝑀 ∥ (𝑀 + (𝑁 − 𝑀)))) |
5 | zcn 9234 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
6 | zcn 9234 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
7 | pncan3 8142 | . . . 4 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝑀 + (𝑁 − 𝑀)) = 𝑁) | |
8 | 5, 6, 7 | syl2an 289 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 + (𝑁 − 𝑀)) = 𝑁) |
9 | 8 | breq2d 4012 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ (𝑀 + (𝑁 − 𝑀)) ↔ 𝑀 ∥ 𝑁)) |
10 | 4, 9 | bitr2d 189 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ 𝑀 ∥ (𝑁 − 𝑀))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 class class class wbr 4000 (class class class)co 5868 ℂcc 7787 + caddc 7792 − cmin 8105 ℤcz 9229 ∥ cdvds 11765 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4205 ax-un 4429 ax-setind 4532 ax-cnex 7880 ax-resscn 7881 ax-1cn 7882 ax-1re 7883 ax-icn 7884 ax-addcl 7885 ax-addrcl 7886 ax-mulcl 7887 ax-addcom 7889 ax-mulcom 7890 ax-addass 7891 ax-mulass 7892 ax-distr 7893 ax-i2m1 7894 ax-0lt1 7895 ax-1rid 7896 ax-0id 7897 ax-rnegex 7898 ax-cnre 7900 ax-pre-ltirr 7901 ax-pre-ltwlin 7902 ax-pre-lttrn 7903 ax-pre-ltadd 7905 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-int 3843 df-br 4001 df-opab 4062 df-id 4289 df-xp 4628 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-iota 5173 df-fun 5213 df-fv 5219 df-riota 5824 df-ov 5871 df-oprab 5872 df-mpo 5873 df-pnf 7971 df-mnf 7972 df-xr 7973 df-ltxr 7974 df-le 7975 df-sub 8107 df-neg 8108 df-inn 8896 df-n0 9153 df-z 9230 df-dvds 11766 |
This theorem is referenced by: ndvdsadd 11906 |
Copyright terms: Public domain | W3C validator |