| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sumnul | Structured version Visualization version GIF version | ||
| Description: The sum of a non-convergent infinite series evaluates to the empty set. (Contributed by Paul Chapman, 4-Nov-2007.) (Revised by Mario Carneiro, 23-Apr-2014.) |
| Ref | Expression |
|---|---|
| isumcl.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| isumcl.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| isumcl.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) |
| isumcl.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) |
| sumnul.5 | ⊢ (𝜑 → ¬ seq𝑀( + , 𝐹) ∈ dom ⇝ ) |
| Ref | Expression |
|---|---|
| sumnul | ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isumcl.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | isumcl.2 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 3 | isumcl.3 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
| 4 | isumcl.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ) | |
| 5 | 1, 2, 3, 4 | isum 15929 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ( ⇝ ‘seq𝑀( + , 𝐹))) |
| 6 | sumnul.5 | . . 3 ⊢ (𝜑 → ¬ seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
| 7 | ndmfv 6948 | . . 3 ⊢ (¬ seq𝑀( + , 𝐹) ∈ dom ⇝ → ( ⇝ ‘seq𝑀( + , 𝐹)) = ∅) | |
| 8 | 6, 7 | syl 18 | . 2 ⊢ (𝜑 → ( ⇝ ‘seq𝑀( + , 𝐹)) = ∅) |
| 9 | 5, 8 | eqtrd 2798 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 𝐴 = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∅c0 4281 dom cdm 5658 ‘cfv 6566 ℂcc 11237 + caddc 11242 ℤcz 12733 ℤ≥cuz 13005 seqcseq 14184 ⇝ cli 15695 Σcsu 15897 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-oi 9541 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-fz 13680 df-fzo 13829 df-seq 14185 df-exp 14245 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-clim 15699 df-sum 15898 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |