![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sumz | Structured version Visualization version GIF version |
Description: Any sum of zero over a summable set is zero. (Contributed by Mario Carneiro, 12-Aug-2013.) (Revised by Mario Carneiro, 20-Apr-2014.) |
Ref | Expression |
---|---|
sumz | ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∨ 𝐴 ∈ Fin) → Σ𝑘 ∈ 𝐴 0 = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2726 | . . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀) | |
2 | simpr 483 | . . . . 5 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) → 𝑀 ∈ ℤ) | |
3 | simpl 481 | . . . . 5 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) → 𝐴 ⊆ (ℤ≥‘𝑀)) | |
4 | c0ex 11258 | . . . . . . . 8 ⊢ 0 ∈ V | |
5 | 4 | fvconst2 7221 | . . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (((ℤ≥‘𝑀) × {0})‘𝑘) = 0) |
6 | ifid 4573 | . . . . . . 7 ⊢ if(𝑘 ∈ 𝐴, 0, 0) = 0 | |
7 | 5, 6 | eqtr4di 2784 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (((ℤ≥‘𝑀) × {0})‘𝑘) = if(𝑘 ∈ 𝐴, 0, 0)) |
8 | 7 | adantl 480 | . . . . 5 ⊢ (((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (((ℤ≥‘𝑀) × {0})‘𝑘) = if(𝑘 ∈ 𝐴, 0, 0)) |
9 | 0cnd 11257 | . . . . 5 ⊢ (((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ 𝐴) → 0 ∈ ℂ) | |
10 | 1, 2, 3, 8, 9 | zsum 15722 | . . . 4 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) → Σ𝑘 ∈ 𝐴 0 = ( ⇝ ‘seq𝑀( + , ((ℤ≥‘𝑀) × {0})))) |
11 | fclim 15555 | . . . . . 6 ⊢ ⇝ :dom ⇝ ⟶ℂ | |
12 | ffun 6731 | . . . . . 6 ⊢ ( ⇝ :dom ⇝ ⟶ℂ → Fun ⇝ ) | |
13 | 11, 12 | ax-mp 5 | . . . . 5 ⊢ Fun ⇝ |
14 | serclim0 15579 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → seq𝑀( + , ((ℤ≥‘𝑀) × {0})) ⇝ 0) | |
15 | 14 | adantl 480 | . . . . 5 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) → seq𝑀( + , ((ℤ≥‘𝑀) × {0})) ⇝ 0) |
16 | funbrfv 6952 | . . . . 5 ⊢ (Fun ⇝ → (seq𝑀( + , ((ℤ≥‘𝑀) × {0})) ⇝ 0 → ( ⇝ ‘seq𝑀( + , ((ℤ≥‘𝑀) × {0}))) = 0)) | |
17 | 13, 15, 16 | mpsyl 68 | . . . 4 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) → ( ⇝ ‘seq𝑀( + , ((ℤ≥‘𝑀) × {0}))) = 0) |
18 | 10, 17 | eqtrd 2766 | . . 3 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ 𝑀 ∈ ℤ) → Σ𝑘 ∈ 𝐴 0 = 0) |
19 | uzf 12877 | . . . . . . . . 9 ⊢ ℤ≥:ℤ⟶𝒫 ℤ | |
20 | 19 | fdmi 6739 | . . . . . . . 8 ⊢ dom ℤ≥ = ℤ |
21 | 20 | eleq2i 2818 | . . . . . . 7 ⊢ (𝑀 ∈ dom ℤ≥ ↔ 𝑀 ∈ ℤ) |
22 | ndmfv 6936 | . . . . . . 7 ⊢ (¬ 𝑀 ∈ dom ℤ≥ → (ℤ≥‘𝑀) = ∅) | |
23 | 21, 22 | sylnbir 330 | . . . . . 6 ⊢ (¬ 𝑀 ∈ ℤ → (ℤ≥‘𝑀) = ∅) |
24 | 23 | sseq2d 4012 | . . . . 5 ⊢ (¬ 𝑀 ∈ ℤ → (𝐴 ⊆ (ℤ≥‘𝑀) ↔ 𝐴 ⊆ ∅)) |
25 | 24 | biimpac 477 | . . . 4 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ ¬ 𝑀 ∈ ℤ) → 𝐴 ⊆ ∅) |
26 | ss0 4403 | . . . 4 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅) | |
27 | sumeq1 15693 | . . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 0 = Σ𝑘 ∈ ∅ 0) | |
28 | sum0 15725 | . . . . 5 ⊢ Σ𝑘 ∈ ∅ 0 = 0 | |
29 | 27, 28 | eqtrdi 2782 | . . . 4 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 0 = 0) |
30 | 25, 26, 29 | 3syl 18 | . . 3 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∧ ¬ 𝑀 ∈ ℤ) → Σ𝑘 ∈ 𝐴 0 = 0) |
31 | 18, 30 | pm2.61dan 811 | . 2 ⊢ (𝐴 ⊆ (ℤ≥‘𝑀) → Σ𝑘 ∈ 𝐴 0 = 0) |
32 | fz1f1o 15714 | . . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) | |
33 | eqidd 2727 | . . . . . . . . 9 ⊢ (𝑘 = (𝑓‘𝑛) → 0 = 0) | |
34 | simpl 481 | . . . . . . . . 9 ⊢ (((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (♯‘𝐴) ∈ ℕ) | |
35 | simpr 483 | . . . . . . . . 9 ⊢ (((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) | |
36 | 0cnd 11257 | . . . . . . . . 9 ⊢ ((((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ 𝑘 ∈ 𝐴) → 0 ∈ ℂ) | |
37 | elfznn 13584 | . . . . . . . . . . 11 ⊢ (𝑛 ∈ (1...(♯‘𝐴)) → 𝑛 ∈ ℕ) | |
38 | 4 | fvconst2 7221 | . . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → ((ℕ × {0})‘𝑛) = 0) |
39 | 37, 38 | syl 17 | . . . . . . . . . 10 ⊢ (𝑛 ∈ (1...(♯‘𝐴)) → ((ℕ × {0})‘𝑛) = 0) |
40 | 39 | adantl 480 | . . . . . . . . 9 ⊢ ((((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ((ℕ × {0})‘𝑛) = 0) |
41 | 33, 34, 35, 36, 40 | fsum 15724 | . . . . . . . 8 ⊢ (((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → Σ𝑘 ∈ 𝐴 0 = (seq1( + , (ℕ × {0}))‘(♯‘𝐴))) |
42 | nnuz 12917 | . . . . . . . . . 10 ⊢ ℕ = (ℤ≥‘1) | |
43 | 42 | ser0 14074 | . . . . . . . . 9 ⊢ ((♯‘𝐴) ∈ ℕ → (seq1( + , (ℕ × {0}))‘(♯‘𝐴)) = 0) |
44 | 43 | adantr 479 | . . . . . . . 8 ⊢ (((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1( + , (ℕ × {0}))‘(♯‘𝐴)) = 0) |
45 | 41, 44 | eqtrd 2766 | . . . . . . 7 ⊢ (((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → Σ𝑘 ∈ 𝐴 0 = 0) |
46 | 45 | ex 411 | . . . . . 6 ⊢ ((♯‘𝐴) ∈ ℕ → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → Σ𝑘 ∈ 𝐴 0 = 0)) |
47 | 46 | exlimdv 1929 | . . . . 5 ⊢ ((♯‘𝐴) ∈ ℕ → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → Σ𝑘 ∈ 𝐴 0 = 0)) |
48 | 47 | imp 405 | . . . 4 ⊢ (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → Σ𝑘 ∈ 𝐴 0 = 0) |
49 | 29, 48 | jaoi 855 | . . 3 ⊢ ((𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑘 ∈ 𝐴 0 = 0) |
50 | 32, 49 | syl 17 | . 2 ⊢ (𝐴 ∈ Fin → Σ𝑘 ∈ 𝐴 0 = 0) |
51 | 31, 50 | jaoi 855 | 1 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑀) ∨ 𝐴 ∈ Fin) → Σ𝑘 ∈ 𝐴 0 = 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∨ wo 845 = wceq 1534 ∃wex 1774 ∈ wcel 2099 ⊆ wss 3947 ∅c0 4325 ifcif 4533 𝒫 cpw 4607 {csn 4633 class class class wbr 5153 × cxp 5680 dom cdm 5682 Fun wfun 6548 ⟶wf 6550 –1-1-onto→wf1o 6553 ‘cfv 6554 (class class class)co 7424 Fincfn 8974 ℂcc 11156 0cc0 11158 1c1 11159 + caddc 11161 ℕcn 12264 ℤcz 12610 ℤ≥cuz 12874 ...cfz 13538 seqcseq 14021 ♯chash 14347 ⇝ cli 15486 Σcsu 15690 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-inf2 9684 ax-cnex 11214 ax-resscn 11215 ax-1cn 11216 ax-icn 11217 ax-addcl 11218 ax-addrcl 11219 ax-mulcl 11220 ax-mulrcl 11221 ax-mulcom 11222 ax-addass 11223 ax-mulass 11224 ax-distr 11225 ax-i2m1 11226 ax-1ne0 11227 ax-1rid 11228 ax-rnegex 11229 ax-rrecex 11230 ax-cnre 11231 ax-pre-lttri 11232 ax-pre-lttrn 11233 ax-pre-ltadd 11234 ax-pre-mulgt0 11235 ax-pre-sup 11236 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-int 4955 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-se 5638 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-isom 6563 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7877 df-1st 8003 df-2nd 8004 df-frecs 8296 df-wrecs 8327 df-recs 8401 df-rdg 8440 df-1o 8496 df-er 8734 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-sup 9485 df-oi 9553 df-card 9982 df-pnf 11300 df-mnf 11301 df-xr 11302 df-ltxr 11303 df-le 11304 df-sub 11496 df-neg 11497 df-div 11922 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12611 df-uz 12875 df-rp 13029 df-fz 13539 df-fzo 13682 df-seq 14022 df-exp 14082 df-hash 14348 df-cj 15104 df-re 15105 df-im 15106 df-sqrt 15240 df-abs 15241 df-clim 15490 df-sum 15691 |
This theorem is referenced by: fsum00 15802 fsumdvds 16310 pwp1fsum 16393 pcfac 16901 ovoliunnul 25527 vitalilem5 25632 itg1addlem5 25721 itg10a 25731 itg0 25800 itgz 25801 plymullem1 26241 coemullem 26277 logtayl 26687 ftalem5 27105 chp1 27195 logexprlim 27254 bposlem2 27314 rpvmasumlem 27516 axcgrid 28850 axlowdimlem16 28891 indsumin 33855 plymulx0 34393 signsplypnf 34396 fsum2dsub 34453 knoppndvlem6 36220 volsupnfl 37366 binomcxplemnn0 44023 binomcxplemnotnn0 44030 sumnnodd 45251 stoweidlem37 45658 fourierdlem103 45830 fourierdlem104 45831 etransclem24 45879 etransclem32 45887 etransclem35 45890 sge0z 45996 aacllem 48549 |
Copyright terms: Public domain | W3C validator |