| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzsubel | GIF version | ||
| Description: Membership of a difference in a finite set of sequential integers. (Contributed by NM, 30-Jul-2005.) |
| Ref | Expression |
|---|---|
| fzsubel | ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐽 ∈ ℤ ∧ 𝐾 ∈ ℤ)) → (𝐽 ∈ (𝑀...𝑁) ↔ (𝐽 − 𝐾) ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | znegcl 9509 | . . 3 ⊢ (𝐾 ∈ ℤ → -𝐾 ∈ ℤ) | |
| 2 | fzaddel 10293 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐽 ∈ ℤ ∧ -𝐾 ∈ ℤ)) → (𝐽 ∈ (𝑀...𝑁) ↔ (𝐽 + -𝐾) ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾)))) | |
| 3 | 1, 2 | sylanr2 405 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐽 ∈ ℤ ∧ 𝐾 ∈ ℤ)) → (𝐽 ∈ (𝑀...𝑁) ↔ (𝐽 + -𝐾) ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾)))) |
| 4 | zcn 9483 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 5 | zcn 9483 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 6 | 4, 5 | anim12i 338 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ)) |
| 7 | zcn 9483 | . . . 4 ⊢ (𝐽 ∈ ℤ → 𝐽 ∈ ℂ) | |
| 8 | zcn 9483 | . . . 4 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
| 9 | 7, 8 | anim12i 338 | . . 3 ⊢ ((𝐽 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝐽 ∈ ℂ ∧ 𝐾 ∈ ℂ)) |
| 10 | negsub 8426 | . . . . 5 ⊢ ((𝐽 ∈ ℂ ∧ 𝐾 ∈ ℂ) → (𝐽 + -𝐾) = (𝐽 − 𝐾)) | |
| 11 | 10 | adantl 277 | . . . 4 ⊢ (((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) ∧ (𝐽 ∈ ℂ ∧ 𝐾 ∈ ℂ)) → (𝐽 + -𝐾) = (𝐽 − 𝐾)) |
| 12 | negsub 8426 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 𝐾 ∈ ℂ) → (𝑀 + -𝐾) = (𝑀 − 𝐾)) | |
| 13 | negsub 8426 | . . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ 𝐾 ∈ ℂ) → (𝑁 + -𝐾) = (𝑁 − 𝐾)) | |
| 14 | 12, 13 | oveqan12d 6036 | . . . . . 6 ⊢ (((𝑀 ∈ ℂ ∧ 𝐾 ∈ ℂ) ∧ (𝑁 ∈ ℂ ∧ 𝐾 ∈ ℂ)) → ((𝑀 + -𝐾)...(𝑁 + -𝐾)) = ((𝑀 − 𝐾)...(𝑁 − 𝐾))) |
| 15 | 14 | anandirs 597 | . . . . 5 ⊢ (((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) ∧ 𝐾 ∈ ℂ) → ((𝑀 + -𝐾)...(𝑁 + -𝐾)) = ((𝑀 − 𝐾)...(𝑁 − 𝐾))) |
| 16 | 15 | adantrl 478 | . . . 4 ⊢ (((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) ∧ (𝐽 ∈ ℂ ∧ 𝐾 ∈ ℂ)) → ((𝑀 + -𝐾)...(𝑁 + -𝐾)) = ((𝑀 − 𝐾)...(𝑁 − 𝐾))) |
| 17 | 11, 16 | eleq12d 2302 | . . 3 ⊢ (((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) ∧ (𝐽 ∈ ℂ ∧ 𝐾 ∈ ℂ)) → ((𝐽 + -𝐾) ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾)) ↔ (𝐽 − 𝐾) ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)))) |
| 18 | 6, 9, 17 | syl2an 289 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐽 ∈ ℤ ∧ 𝐾 ∈ ℤ)) → ((𝐽 + -𝐾) ∈ ((𝑀 + -𝐾)...(𝑁 + -𝐾)) ↔ (𝐽 − 𝐾) ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)))) |
| 19 | 3, 18 | bitrd 188 | 1 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐽 ∈ ℤ ∧ 𝐾 ∈ ℤ)) → (𝐽 ∈ (𝑀...𝑁) ↔ (𝐽 − 𝐾) ∈ ((𝑀 − 𝐾)...(𝑁 − 𝐾)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 (class class class)co 6017 ℂcc 8029 + caddc 8034 − cmin 8349 -cneg 8350 ℤcz 9478 ...cfz 10242 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-inn 9143 df-n0 9402 df-z 9479 df-fz 10243 |
| This theorem is referenced by: elfzp1b 10331 elfzm1b 10332 fisum0diag2 12007 |
| Copyright terms: Public domain | W3C validator |