| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ntrivcvgap0 | GIF version | ||
| Description: A product that converges to a value apart from zero converges non-trivially. (Contributed by Scott Fenton, 18-Dec-2017.) |
| Ref | Expression |
|---|---|
| ntrivcvgn0.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| ntrivcvgn0.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| ntrivcvgn0.3 | ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) |
| ntrivcvgap0.4 | ⊢ (𝜑 → 𝑋 # 0) |
| Ref | Expression |
|---|---|
| ntrivcvgap0 | ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ntrivcvgn0.2 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 2 | uzid 9886 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 4 | ntrivcvgn0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 5 | 3, 4 | eleqtrrdi 2328 | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
| 6 | ntrivcvgn0.3 | . . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
| 7 | climrel 11990 | . . . . 5 ⊢ Rel ⇝ | |
| 8 | 7 | brrelex2i 4799 | . . . 4 ⊢ (seq𝑀( · , 𝐹) ⇝ 𝑋 → 𝑋 ∈ V) |
| 9 | 6, 8 | syl 14 | . . 3 ⊢ (𝜑 → 𝑋 ∈ V) |
| 10 | ntrivcvgap0.4 | . . . 4 ⊢ (𝜑 → 𝑋 # 0) | |
| 11 | 10, 6 | jca 306 | . . 3 ⊢ (𝜑 → (𝑋 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋)) |
| 12 | breq1 4117 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑦 # 0 ↔ 𝑋 # 0)) | |
| 13 | breq2 4118 | . . . 4 ⊢ (𝑦 = 𝑋 → (seq𝑀( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑋)) | |
| 14 | 12, 13 | anbi12d 473 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦) ↔ (𝑋 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋))) |
| 15 | 9, 11, 14 | elabd 2965 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 16 | seqeq1 10836 | . . . . . 6 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹)) | |
| 17 | 16 | breq1d 4124 | . . . . 5 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 18 | 17 | anbi2d 464 | . . . 4 ⊢ (𝑛 = 𝑀 → ((𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 19 | 18 | exbidv 1874 | . . 3 ⊢ (𝑛 = 𝑀 → (∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 20 | 19 | rspcev 2923 | . 2 ⊢ ((𝑀 ∈ 𝑍 ∧ ∃𝑦(𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| 21 | 5, 15, 20 | syl2anc 411 | 1 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∃wex 1541 ∈ wcel 2205 ∃wrex 2523 Vcvv 2815 class class class wbr 4114 ‘cfv 5357 0cc0 8143 · cmul 8148 # cap 8872 ℤcz 9594 ℤ≥cuz 9871 seqcseq 10833 ⇝ cli 11988 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-pre-ltirr 8255 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3046 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-iota 5317 df-fun 5359 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-recs 6549 df-frec 6635 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-neg 8463 df-z 9595 df-uz 9872 df-seqfrec 10834 df-clim 11989 |
| This theorem is referenced by: zprodap0 12292 |
| Copyright terms: Public domain | W3C validator |