![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fzval2 | Structured version Visualization version GIF version |
Description: An alternative way of expressing a finite set of sequential integers. (Contributed by Mario Carneiro, 3-Nov-2013.) |
Ref | Expression |
---|---|
fzval2 | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) = ((𝑀[,]𝑁) ∩ ℤ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fzval 13545 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) = {𝑘 ∈ ℤ ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)}) | |
2 | zssre 12617 | . . . . . . 7 ⊢ ℤ ⊆ ℝ | |
3 | ressxr 11302 | . . . . . . 7 ⊢ ℝ ⊆ ℝ* | |
4 | 2, 3 | sstri 4004 | . . . . . 6 ⊢ ℤ ⊆ ℝ* |
5 | 4 | sseli 3990 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ*) |
6 | 4 | sseli 3990 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ*) |
7 | iccval 13422 | . . . . 5 ⊢ ((𝑀 ∈ ℝ* ∧ 𝑁 ∈ ℝ*) → (𝑀[,]𝑁) = {𝑘 ∈ ℝ* ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)}) | |
8 | 5, 6, 7 | syl2an 596 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀[,]𝑁) = {𝑘 ∈ ℝ* ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)}) |
9 | 8 | ineq1d 4226 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀[,]𝑁) ∩ ℤ) = ({𝑘 ∈ ℝ* ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} ∩ ℤ)) |
10 | inrab2 4322 | . . . 4 ⊢ ({𝑘 ∈ ℝ* ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} ∩ ℤ) = {𝑘 ∈ (ℝ* ∩ ℤ) ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} | |
11 | sseqin2 4230 | . . . . . 6 ⊢ (ℤ ⊆ ℝ* ↔ (ℝ* ∩ ℤ) = ℤ) | |
12 | 4, 11 | mpbi 230 | . . . . 5 ⊢ (ℝ* ∩ ℤ) = ℤ |
13 | 12 | rabeqi 3446 | . . . 4 ⊢ {𝑘 ∈ (ℝ* ∩ ℤ) ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} = {𝑘 ∈ ℤ ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} |
14 | 10, 13 | eqtri 2762 | . . 3 ⊢ ({𝑘 ∈ ℝ* ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} ∩ ℤ) = {𝑘 ∈ ℤ ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} |
15 | 9, 14 | eqtr2di 2791 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑘 ∈ ℤ ∣ (𝑀 ≤ 𝑘 ∧ 𝑘 ≤ 𝑁)} = ((𝑀[,]𝑁) ∩ ℤ)) |
16 | 1, 15 | eqtrd 2774 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) = ((𝑀[,]𝑁) ∩ ℤ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 {crab 3432 ∩ cin 3961 ⊆ wss 3962 class class class wbr 5147 (class class class)co 7430 ℝcr 11151 ℝ*cxr 11291 ≤ cle 11293 ℤcz 12610 [,]cicc 13386 ...cfz 13543 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-sbc 3791 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-id 5582 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-iota 6515 df-fun 6564 df-fv 6570 df-ov 7433 df-oprab 7434 df-mpo 7435 df-xr 11296 df-neg 11492 df-z 12611 df-icc 13390 df-fz 13544 |
This theorem is referenced by: dvfsumle 26074 dvfsumleOLD 26075 dvfsumabs 26077 taylplem1 26418 taylplem2 26419 taylpfval 26420 dvtaylp 26426 ppisval 27161 |
Copyright terms: Public domain | W3C validator |