| 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 12795 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 3 | ntrivcvgn0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrrdi 2850 | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
| 5 | ntrivcvgn0.3 | . . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
| 6 | climrel 15445 | . . . . 5 ⊢ Rel ⇝ | |
| 7 | 6 | brrelex2i 5675 | . . . 4 ⊢ (seq𝑀( · , 𝐹) ⇝ 𝑋 → 𝑋 ∈ V) |
| 8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑋 ∈ V) |
| 9 | ntrivcvgn0.4 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
| 10 | 9, 5 | jca 516 | . . 3 ⊢ (𝜑 → (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋)) |
| 11 | neeq1 2996 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑦 ≠ 0 ↔ 𝑋 ≠ 0)) | |
| 12 | breq2 5076 | . . . 4 ⊢ (𝑦 = 𝑋 → (seq𝑀( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑋)) | |
| 13 | 11, 12 | anbi12d 638 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦) ↔ (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋))) |
| 14 | 8, 10, 13 | spcedv 3536 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 15 | seqeq1 13957 | . . . . . 6 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹)) | |
| 16 | 15 | breq1d 5082 | . . . . 5 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 17 | 16 | anbi2d 636 | . . . 4 ⊢ (𝑛 = 𝑀 → ((𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 18 | 17 | exbidv 1928 | . . 3 ⊢ (𝑛 = 𝑀 → (∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 19 | 18 | rspcev 3560 | . 2 ⊢ ((𝑀 ∈ 𝑍 ∧ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| 20 | 4, 14, 19 | syl2anc 590 | 1 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∃wex 1786 ∈ wcel 2119 ≠ wne 2934 ∃wrex 3063 Vcvv 3431 class class class wbr 5072 ‘cfv 6485 0cc0 11029 · cmul 11034 ℤcz 12515 ℤ≥cuz 12779 seqcseq 13954 ⇝ cli 15437 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-pre-lttri 11103 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-ov 7359 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-neg 11371 df-z 12516 df-uz 12780 df-seq 13955 df-clim 15441 |
| This theorem is referenced by: zprodn0 15895 |
| Copyright terms: Public domain | W3C validator |