| 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 12758 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 3 | ntrivcvgn0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 4 | 2, 3 | eleqtrrdi 2844 | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
| 5 | ntrivcvgn0.3 | . . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
| 6 | climrel 15406 | . . . . 5 ⊢ Rel ⇝ | |
| 7 | 6 | brrelex2i 5678 | . . . 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 2991 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑦 ≠ 0 ↔ 𝑋 ≠ 0)) | |
| 12 | breq2 5099 | . . . 4 ⊢ (𝑦 = 𝑋 → (seq𝑀( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑋)) | |
| 13 | 11, 12 | anbi12d 632 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦) ↔ (𝑋 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋))) |
| 14 | 8, 10, 13 | spcedv 3549 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 15 | seqeq1 13918 | . . . . . 6 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹)) | |
| 16 | 15 | breq1d 5105 | . . . . 5 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 17 | 16 | anbi2d 630 | . . . 4 ⊢ (𝑛 = 𝑀 → ((𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 18 | 17 | exbidv 1922 | . . 3 ⊢ (𝑛 = 𝑀 → (∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 19 | 18 | rspcev 3573 | . 2 ⊢ ((𝑀 ∈ 𝑍 ∧ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| 20 | 4, 14, 19 | syl2anc 584 | 1 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2113 ≠ wne 2929 ∃wrex 3057 Vcvv 3437 class class class wbr 5095 ‘cfv 6489 0cc0 11017 · cmul 11022 ℤcz 12479 ℤ≥cuz 12742 seqcseq 13915 ⇝ cli 15398 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-pre-lttri 11091 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7358 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-neg 11358 df-z 12480 df-uz 12743 df-seq 13916 df-clim 15402 |
| This theorem is referenced by: zprodn0 15853 |
| Copyright terms: Public domain | W3C validator |