Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ntrivcvgn0 | Structured version Visualization version GIF version |
Description: A product that converges to a nonzero value converges non-trivially. (Contributed by Scott Fenton, 18-Dec-2017.) |
Ref | Expression |
---|---|
ntrivcvgn0.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
ntrivcvgn0.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
ntrivcvgn0.3 | ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) |
ntrivcvgn0.4 | ⊢ (𝜑 → 𝑋 ≠ 0) |
Ref | Expression |
---|---|
ntrivcvgn0 | ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ntrivcvgn0.2 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
2 | 1 | uzidd 12527 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
3 | ntrivcvgn0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 2, 3 | eleqtrrdi 2850 | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
5 | ntrivcvgn0.3 | . . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
6 | climrel 15129 | . . . . 5 ⊢ Rel ⇝ | |
7 | 6 | brrelex2i 5635 | . . . 4 ⊢ (seq𝑀( · , 𝐹) ⇝ 𝑋 → 𝑋 ∈ V) |
8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑋 ∈ V) |
9 | ntrivcvgn0.4 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
10 | 9, 5 | jca 511 | . . 3 ⊢ (𝜑 → (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋)) |
11 | neeq1 3005 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑦 ≠ 0 ↔ 𝑋 ≠ 0)) | |
12 | breq2 5074 | . . . 4 ⊢ (𝑦 = 𝑋 → (seq𝑀( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑋)) | |
13 | 11, 12 | anbi12d 630 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦) ↔ (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋))) |
14 | 8, 10, 13 | spcedv 3527 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
15 | seqeq1 13652 | . . . . . 6 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹)) | |
16 | 15 | breq1d 5080 | . . . . 5 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
17 | 16 | anbi2d 628 | . . . 4 ⊢ (𝑛 = 𝑀 → ((𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
18 | 17 | exbidv 1925 | . . 3 ⊢ (𝑛 = 𝑀 → (∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
19 | 18 | rspcev 3552 | . 2 ⊢ ((𝑀 ∈ 𝑍 ∧ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
20 | 4, 14, 19 | syl2anc 583 | 1 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ≠ wne 2942 ∃wrex 3064 Vcvv 3422 class class class wbr 5070 ‘cfv 6418 0cc0 10802 · cmul 10807 ℤcz 12249 ℤ≥cuz 12511 seqcseq 13649 ⇝ cli 15121 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-pre-lttri 10876 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-neg 11138 df-z 12250 df-uz 12512 df-seq 13650 df-clim 15125 |
This theorem is referenced by: zprodn0 15577 |
Copyright terms: Public domain | W3C validator |