| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sum0 | GIF version | ||
| Description: Any sum over the empty set is zero. (Contributed by Mario Carneiro, 12-Aug-2013.) (Revised by Mario Carneiro, 20-Apr-2014.) |
| Ref | Expression |
|---|---|
| sum0 | ⊢ Σ𝑘 ∈ ∅ 𝐴 = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnuz 9785 | . . . 4 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 9499 | . . . 4 ⊢ (⊤ → 1 ∈ ℤ) | |
| 3 | 0ss 3531 | . . . . 5 ⊢ ∅ ⊆ ℕ | |
| 4 | 3 | a1i 9 | . . . 4 ⊢ (⊤ → ∅ ⊆ ℕ) |
| 5 | simpr 110 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 6 | 5, 1 | eleqtrdi 2322 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1)) |
| 7 | c0ex 8166 | . . . . . . 7 ⊢ 0 ∈ V | |
| 8 | 7 | fvconst2 5865 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘1) → (((ℤ≥‘1) × {0})‘𝑘) = 0) |
| 9 | 6, 8 | syl 14 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (((ℤ≥‘1) × {0})‘𝑘) = 0) |
| 10 | noel 3496 | . . . . . 6 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 3612 | . . . . 5 ⊢ if(𝑘 ∈ ∅, 𝐴, 0) = 0 |
| 12 | 9, 11 | eqtr4di 2280 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (((ℤ≥‘1) × {0})‘𝑘) = if(𝑘 ∈ ∅, 𝐴, 0)) |
| 13 | noel 3496 | . . . . . . . 8 ⊢ ¬ 𝑗 ∈ ∅ | |
| 14 | 13 | olci 737 | . . . . . . 7 ⊢ (𝑗 ∈ ∅ ∨ ¬ 𝑗 ∈ ∅) |
| 15 | df-dc 840 | . . . . . . 7 ⊢ (DECID 𝑗 ∈ ∅ ↔ (𝑗 ∈ ∅ ∨ ¬ 𝑗 ∈ ∅)) | |
| 16 | 14, 15 | mpbir 146 | . . . . . 6 ⊢ DECID 𝑗 ∈ ∅ |
| 17 | 16 | rgenw 2585 | . . . . 5 ⊢ ∀𝑗 ∈ ℕ DECID 𝑗 ∈ ∅ |
| 18 | 17 | a1i 9 | . . . 4 ⊢ (⊤ → ∀𝑗 ∈ ℕ DECID 𝑗 ∈ ∅) |
| 19 | 10 | pm2.21i 649 | . . . . 5 ⊢ (𝑘 ∈ ∅ → 𝐴 ∈ ℂ) |
| 20 | 19 | adantl 277 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ∅) → 𝐴 ∈ ℂ) |
| 21 | 1, 2, 4, 12, 18, 20 | zsumdc 11938 | . . 3 ⊢ (⊤ → Σ𝑘 ∈ ∅ 𝐴 = ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0})))) |
| 22 | 21 | mptru 1404 | . 2 ⊢ Σ𝑘 ∈ ∅ 𝐴 = ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0}))) |
| 23 | fclim 11848 | . . . 4 ⊢ ⇝ :dom ⇝ ⟶ℂ | |
| 24 | ffun 5482 | . . . 4 ⊢ ( ⇝ :dom ⇝ ⟶ℂ → Fun ⇝ ) | |
| 25 | 23, 24 | ax-mp 5 | . . 3 ⊢ Fun ⇝ |
| 26 | 1z 9498 | . . . 4 ⊢ 1 ∈ ℤ | |
| 27 | serclim0 11859 | . . . 4 ⊢ (1 ∈ ℤ → seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0) | |
| 28 | 26, 27 | ax-mp 5 | . . 3 ⊢ seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0 |
| 29 | funbrfv 5678 | . . 3 ⊢ (Fun ⇝ → (seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0 → ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0}))) = 0)) | |
| 30 | 25, 28, 29 | mp2 16 | . 2 ⊢ ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0}))) = 0 |
| 31 | 22, 30 | eqtri 2250 | 1 ⊢ Σ𝑘 ∈ ∅ 𝐴 = 0 |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 ∨ wo 713 DECID wdc 839 = wceq 1395 ⊤wtru 1396 ∈ wcel 2200 ∀wral 2508 ⊆ wss 3198 ∅c0 3492 ifcif 3603 {csn 3667 class class class wbr 4086 × cxp 4721 dom cdm 4723 Fun wfun 5318 ⟶wf 5320 ‘cfv 5324 ℂcc 8023 0cc0 8025 1c1 8026 + caddc 8028 ℕcn 9136 ℤcz 9472 ℤ≥cuz 9748 seqcseq 10702 ⇝ cli 11832 Σcsu 11907 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 ax-arch 8144 ax-caucvg 8145 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-irdg 6531 df-frec 6552 df-1o 6577 df-oadd 6581 df-er 6697 df-en 6905 df-dom 6906 df-fin 6907 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-n0 9396 df-z 9473 df-uz 9749 df-q 9847 df-rp 9882 df-fz 10237 df-fzo 10371 df-seqfrec 10703 df-exp 10794 df-ihash 11031 df-cj 11396 df-re 11397 df-im 11398 df-rsqrt 11552 df-abs 11553 df-clim 11833 df-sumdc 11908 |
| This theorem is referenced by: isumz 11943 fsumf1o 11944 fsumcllem 11953 fsumadd 11960 fsum2d 11989 fisumrev2 12000 fsummulc2 12002 fsumconst 12008 modfsummod 12012 fsumabs 12019 telfsumo 12020 fsumparts 12024 fsumrelem 12025 fsumiun 12031 isumsplit 12045 arisum 12052 arisum2 12053 cvgratnnlemseq 12080 bitsinv1 12516 gsumfzfsumlem0 14593 fsumcncntop 15284 dvmptfsum 15442 |
| Copyright terms: Public domain | W3C validator |