| 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 9868 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 4 | ntrivcvgn0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 5 | 3, 4 | eleqtrrdi 2326 | . 2 ⊢ (𝜑 → 𝑀 ∈ 𝑍) |
| 6 | ntrivcvgn0.3 | . . . 4 ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝑋) | |
| 7 | climrel 11965 | . . . . 5 ⊢ Rel ⇝ | |
| 8 | 7 | brrelex2i 4794 | . . . 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 4112 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑦 # 0 ↔ 𝑋 # 0)) | |
| 13 | breq2 4113 | . . . 4 ⊢ (𝑦 = 𝑋 → (seq𝑀( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑋)) | |
| 14 | 12, 13 | anbi12d 473 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦) ↔ (𝑋 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑋))) |
| 15 | 9, 11, 14 | elabd 2962 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 16 | seqeq1 10812 | . . . . . 6 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹)) | |
| 17 | 16 | breq1d 4119 | . . . . 5 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦)) |
| 18 | 17 | anbi2d 464 | . . . 4 ⊢ (𝑛 = 𝑀 → ((𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 19 | 18 | exbidv 1874 | . . 3 ⊢ (𝑛 = 𝑀 → (∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 # 0 ∧ seq𝑀( · , 𝐹) ⇝ 𝑦))) |
| 20 | 19 | rspcev 2921 | . 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 2203 ∃wrex 2521 Vcvv 2813 class class class wbr 4109 ‘cfv 5352 0cc0 8127 · cmul 8132 # cap 8855 ℤcz 9577 ℤ≥cuz 9853 seqcseq 10809 ⇝ cli 11963 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-pre-ltirr 8239 |
| 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 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2815 df-sbc 3043 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-iota 5312 df-fun 5354 df-fv 5360 df-ov 6053 df-oprab 6054 df-mpo 6055 df-recs 6536 df-frec 6622 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-neg 8447 df-z 9578 df-uz 9854 df-seqfrec 10810 df-clim 11964 |
| This theorem is referenced by: zprodap0 12267 |
| Copyright terms: Public domain | W3C validator |