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 12298 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
3 | ntrivcvgn0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 2, 3 | eleqtrrdi 2863 | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
5 | ntrivcvgn0.3 | . . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
6 | climrel 14897 | . . . . 5 ⊢ Rel ⇝ | |
7 | 6 | brrelex2i 5578 | . . . 4 ⊢ (seq𝑀( · , 𝐹) ⇝ 𝑋 → 𝑋 ∈ V) |
8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑋 ∈ V) |
9 | ntrivcvgn0.4 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
10 | 9, 5 | jca 515 | . . 3 ⊢ (𝜑 → (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋)) |
11 | neeq1 3013 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑦 ≠ 0 ↔ 𝑋 ≠ 0)) | |
12 | breq2 5036 | . . . 4 ⊢ (𝑦 = 𝑋 → (seq𝑀( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑋)) | |
13 | 11, 12 | anbi12d 633 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦) ↔ (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋))) |
14 | 8, 10, 13 | spcedv 3517 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
15 | seqeq1 13421 | . . . . . 6 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹)) | |
16 | 15 | breq1d 5042 | . . . . 5 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
17 | 16 | anbi2d 631 | . . . 4 ⊢ (𝑛 = 𝑀 → ((𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
18 | 17 | exbidv 1922 | . . 3 ⊢ (𝑛 = 𝑀 → (∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
19 | 18 | rspcev 3541 | . 2 ⊢ ((𝑀 ∈ 𝑍 ∧ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
20 | 4, 14, 19 | syl2anc 587 | 1 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ≠ wne 2951 ∃wrex 3071 Vcvv 3409 class class class wbr 5032 ‘cfv 6335 0cc0 10575 · cmul 10580 ℤcz 12020 ℤ≥cuz 12282 seqcseq 13418 ⇝ cli 14889 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5169 ax-nul 5176 ax-pow 5234 ax-pr 5298 ax-un 7459 ax-cnex 10631 ax-resscn 10632 ax-pre-lttri 10649 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-nel 3056 df-ral 3075 df-rex 3076 df-rab 3079 df-v 3411 df-sbc 3697 df-csb 3806 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-nul 4226 df-if 4421 df-pw 4496 df-sn 4523 df-pr 4525 df-op 4529 df-uni 4799 df-br 5033 df-opab 5095 df-mpt 5113 df-id 5430 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-rn 5535 df-res 5536 df-ima 5537 df-pred 6126 df-iota 6294 df-fun 6337 df-fn 6338 df-f 6339 df-f1 6340 df-fo 6341 df-f1o 6342 df-fv 6343 df-ov 7153 df-wrecs 7957 df-recs 8018 df-rdg 8056 df-er 8299 df-en 8528 df-dom 8529 df-sdom 8530 df-pnf 10715 df-mnf 10716 df-xr 10717 df-ltxr 10718 df-le 10719 df-neg 10911 df-z 12021 df-uz 12283 df-seq 13419 df-clim 14893 |
This theorem is referenced by: zprodn0 15341 |
Copyright terms: Public domain | W3C validator |