Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > climresmpt | Structured version Visualization version GIF version |
Description: A function restricted to upper integers converges iff the original function converges. (Contributed by Glauco Siliprandi, 8-Apr-2021.) |
Ref | Expression |
---|---|
climresmpt.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
climresmpt.f | ⊢ 𝐹 = (𝑥 ∈ 𝑍 ↦ 𝐴) |
climresmpt.n | ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
climresmpt.g | ⊢ 𝐺 = (𝑥 ∈ (ℤ≥‘𝑁) ↦ 𝐴) |
Ref | Expression |
---|---|
climresmpt | ⊢ (𝜑 → (𝐺 ⇝ 𝐵 ↔ 𝐹 ⇝ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | climresmpt.f | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝑍 ↦ 𝐴) | |
2 | 1 | reseq1i 5313 | . . . . 5 ⊢ (𝐹 ↾ (ℤ≥‘𝑁)) = ((𝑥 ∈ 𝑍 ↦ 𝐴) ↾ (ℤ≥‘𝑁)) |
3 | 2 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝐹 ↾ (ℤ≥‘𝑁)) = ((𝑥 ∈ 𝑍 ↦ 𝐴) ↾ (ℤ≥‘𝑁))) |
4 | climresmpt.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
5 | climresmpt.z | . . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
6 | 4, 5 | syl6eleq 2698 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
7 | uzss 11584 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) | |
8 | 6, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
9 | 8, 5 | syl6sseqr 3615 | . . . . 5 ⊢ (𝜑 → (ℤ≥‘𝑁) ⊆ 𝑍) |
10 | resmpt 5369 | . . . . 5 ⊢ ((ℤ≥‘𝑁) ⊆ 𝑍 → ((𝑥 ∈ 𝑍 ↦ 𝐴) ↾ (ℤ≥‘𝑁)) = (𝑥 ∈ (ℤ≥‘𝑁) ↦ 𝐴)) | |
11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑍 ↦ 𝐴) ↾ (ℤ≥‘𝑁)) = (𝑥 ∈ (ℤ≥‘𝑁) ↦ 𝐴)) |
12 | climresmpt.g | . . . . . 6 ⊢ 𝐺 = (𝑥 ∈ (ℤ≥‘𝑁) ↦ 𝐴) | |
13 | 12 | eqcomi 2619 | . . . . 5 ⊢ (𝑥 ∈ (ℤ≥‘𝑁) ↦ 𝐴) = 𝐺 |
14 | 13 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (ℤ≥‘𝑁) ↦ 𝐴) = 𝐺) |
15 | 3, 11, 14 | 3eqtrrd 2649 | . . 3 ⊢ (𝜑 → 𝐺 = (𝐹 ↾ (ℤ≥‘𝑁))) |
16 | 15 | breq1d 4593 | . 2 ⊢ (𝜑 → (𝐺 ⇝ 𝐵 ↔ (𝐹 ↾ (ℤ≥‘𝑁)) ⇝ 𝐵)) |
17 | eluzelz 11573 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
18 | 6, 17 | syl 17 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
19 | fvex 6113 | . . . . . . 7 ⊢ (ℤ≥‘𝑀) ∈ V | |
20 | 5, 19 | eqeltri 2684 | . . . . . 6 ⊢ 𝑍 ∈ V |
21 | 20 | mptex 6390 | . . . . 5 ⊢ (𝑥 ∈ 𝑍 ↦ 𝐴) ∈ V |
22 | 21 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑍 ↦ 𝐴) ∈ V) |
23 | 1, 22 | syl5eqel 2692 | . . 3 ⊢ (𝜑 → 𝐹 ∈ V) |
24 | climres 14154 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐹 ∈ V) → ((𝐹 ↾ (ℤ≥‘𝑁)) ⇝ 𝐵 ↔ 𝐹 ⇝ 𝐵)) | |
25 | 18, 23, 24 | syl2anc 691 | . 2 ⊢ (𝜑 → ((𝐹 ↾ (ℤ≥‘𝑁)) ⇝ 𝐵 ↔ 𝐹 ⇝ 𝐵)) |
26 | 16, 25 | bitrd 267 | 1 ⊢ (𝜑 → (𝐺 ⇝ 𝐵 ↔ 𝐹 ⇝ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ⊆ wss 3540 class class class wbr 4583 ↦ cmpt 4643 ↾ cres 5040 ‘cfv 5804 ℤcz 11254 ℤ≥cuz 11563 ⇝ cli 14063 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-pre-lttri 9889 ax-pre-lttrn 9890 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-neg 10148 df-z 11255 df-uz 11564 df-clim 14067 |
This theorem is referenced by: meaiininclem 39376 |
Copyright terms: Public domain | W3C validator |