Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iseraltlem1 | Structured version Visualization version GIF version |
Description: Lemma for iseralt 15044. A decreasing sequence with limit zero consists of positive terms. (Contributed by Mario Carneiro, 6-Apr-2015.) |
Ref | Expression |
---|---|
iseralt.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
iseralt.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
iseralt.3 | ⊢ (𝜑 → 𝐺:𝑍⟶ℝ) |
iseralt.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘(𝑘 + 1)) ≤ (𝐺‘𝑘)) |
iseralt.5 | ⊢ (𝜑 → 𝐺 ⇝ 0) |
Ref | Expression |
---|---|
iseraltlem1 | ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → 0 ≤ (𝐺‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2824 | . 2 ⊢ (ℤ≥‘𝑁) = (ℤ≥‘𝑁) | |
2 | eluzelz 12256 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
3 | iseralt.1 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 2, 3 | eleq2s 2934 | . . 3 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ ℤ) |
5 | 4 | adantl 484 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → 𝑁 ∈ ℤ) |
6 | iseralt.5 | . . 3 ⊢ (𝜑 → 𝐺 ⇝ 0) | |
7 | 6 | adantr 483 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → 𝐺 ⇝ 0) |
8 | iseralt.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝑍⟶ℝ) | |
9 | 8 | ffvelrnda 6854 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → (𝐺‘𝑁) ∈ ℝ) |
10 | 9 | recnd 10672 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → (𝐺‘𝑁) ∈ ℂ) |
11 | 1z 12015 | . . 3 ⊢ 1 ∈ ℤ | |
12 | uzssz 12267 | . . . 4 ⊢ (ℤ≥‘1) ⊆ ℤ | |
13 | zex 11993 | . . . 4 ⊢ ℤ ∈ V | |
14 | 12, 13 | climconst2 14908 | . . 3 ⊢ (((𝐺‘𝑁) ∈ ℂ ∧ 1 ∈ ℤ) → (ℤ × {(𝐺‘𝑁)}) ⇝ (𝐺‘𝑁)) |
15 | 10, 11, 14 | sylancl 588 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → (ℤ × {(𝐺‘𝑁)}) ⇝ (𝐺‘𝑁)) |
16 | 8 | ad2antrr 724 | . . 3 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → 𝐺:𝑍⟶ℝ) |
17 | 3 | uztrn2 12265 | . . . 4 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → 𝑛 ∈ 𝑍) |
18 | 17 | adantll 712 | . . 3 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → 𝑛 ∈ 𝑍) |
19 | 16, 18 | ffvelrnd 6855 | . 2 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → (𝐺‘𝑛) ∈ ℝ) |
20 | eluzelz 12256 | . . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘𝑁) → 𝑛 ∈ ℤ) | |
21 | 20 | adantl 484 | . . . 4 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → 𝑛 ∈ ℤ) |
22 | fvex 6686 | . . . . 5 ⊢ (𝐺‘𝑁) ∈ V | |
23 | 22 | fvconst2 6969 | . . . 4 ⊢ (𝑛 ∈ ℤ → ((ℤ × {(𝐺‘𝑁)})‘𝑛) = (𝐺‘𝑁)) |
24 | 21, 23 | syl 17 | . . 3 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → ((ℤ × {(𝐺‘𝑁)})‘𝑛) = (𝐺‘𝑁)) |
25 | 9 | adantr 483 | . . 3 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → (𝐺‘𝑁) ∈ ℝ) |
26 | 24, 25 | eqeltrd 2916 | . 2 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → ((ℤ × {(𝐺‘𝑁)})‘𝑛) ∈ ℝ) |
27 | simpr 487 | . . . 4 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → 𝑛 ∈ (ℤ≥‘𝑁)) | |
28 | 16 | adantr 483 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (𝑁...𝑛)) → 𝐺:𝑍⟶ℝ) |
29 | simplr 767 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → 𝑁 ∈ 𝑍) | |
30 | elfzuz 12907 | . . . . . 6 ⊢ (𝑘 ∈ (𝑁...𝑛) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
31 | 3 | uztrn2 12265 | . . . . . 6 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → 𝑘 ∈ 𝑍) |
32 | 29, 30, 31 | syl2an 597 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (𝑁...𝑛)) → 𝑘 ∈ 𝑍) |
33 | 28, 32 | ffvelrnd 6855 | . . . 4 ⊢ ((((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (𝑁...𝑛)) → (𝐺‘𝑘) ∈ ℝ) |
34 | simpl 485 | . . . . 5 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → (𝜑 ∧ 𝑁 ∈ 𝑍)) | |
35 | elfzuz 12907 | . . . . 5 ⊢ (𝑘 ∈ (𝑁...(𝑛 − 1)) → 𝑘 ∈ (ℤ≥‘𝑁)) | |
36 | 31 | adantll 712 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → 𝑘 ∈ 𝑍) |
37 | iseralt.4 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘(𝑘 + 1)) ≤ (𝐺‘𝑘)) | |
38 | 37 | adantlr 713 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑘 ∈ 𝑍) → (𝐺‘(𝑘 + 1)) ≤ (𝐺‘𝑘)) |
39 | 36, 38 | syldan 593 | . . . . 5 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → (𝐺‘(𝑘 + 1)) ≤ (𝐺‘𝑘)) |
40 | 34, 35, 39 | syl2an 597 | . . . 4 ⊢ ((((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (𝑁...(𝑛 − 1))) → (𝐺‘(𝑘 + 1)) ≤ (𝐺‘𝑘)) |
41 | 27, 33, 40 | monoord2 13404 | . . 3 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → (𝐺‘𝑛) ≤ (𝐺‘𝑁)) |
42 | 41, 24 | breqtrrd 5097 | . 2 ⊢ (((𝜑 ∧ 𝑁 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ≥‘𝑁)) → (𝐺‘𝑛) ≤ ((ℤ × {(𝐺‘𝑁)})‘𝑛)) |
43 | 1, 5, 7, 15, 19, 26, 42 | climle 14999 | 1 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝑍) → 0 ≤ (𝐺‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {csn 4570 class class class wbr 5069 × cxp 5556 ⟶wf 6354 ‘cfv 6358 (class class class)co 7159 ℂcc 10538 ℝcr 10539 0cc0 10540 1c1 10541 + caddc 10543 ≤ cle 10679 − cmin 10873 ℤcz 11984 ℤ≥cuz 12246 ...cfz 12895 ⇝ cli 14844 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-pre-sup 10618 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-pm 8412 df-en 8513 df-dom 8514 df-sdom 8515 df-sup 8909 df-inf 8910 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-div 11301 df-nn 11642 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-fz 12896 df-fl 13165 df-seq 13373 df-exp 13433 df-cj 14461 df-re 14462 df-im 14463 df-sqrt 14597 df-abs 14598 df-clim 14848 df-rlim 14849 |
This theorem is referenced by: iseraltlem3 15043 iseralt 15044 |
Copyright terms: Public domain | W3C validator |