| 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 9908 | . . . 4 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 9621 | . . . 4 ⊢ (⊤ → 1 ∈ ℤ) | |
| 3 | 0ss 3551 | . . . . 5 ⊢ ∅ ⊆ ℕ | |
| 4 | 3 | a1i 9 | . . . 4 ⊢ (⊤ → ∅ ⊆ ℕ) |
| 5 | simpr 110 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 6 | 5, 1 | eleqtrdi 2327 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1)) |
| 7 | c0ex 8284 | . . . . . . 7 ⊢ 0 ∈ V | |
| 8 | 7 | fvconst2 5905 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘1) → (((ℤ≥‘1) × {0})‘𝑘) = 0) |
| 9 | 6, 8 | syl 14 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (((ℤ≥‘1) × {0})‘𝑘) = 0) |
| 10 | noel 3516 | . . . . . 6 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 3635 | . . . . 5 ⊢ if(𝑘 ∈ ∅, 𝐴, 0) = 0 |
| 12 | 9, 11 | eqtr4di 2285 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (((ℤ≥‘1) × {0})‘𝑘) = if(𝑘 ∈ ∅, 𝐴, 0)) |
| 13 | noel 3516 | . . . . . . . 8 ⊢ ¬ 𝑗 ∈ ∅ | |
| 14 | 13 | olci 740 | . . . . . . 7 ⊢ (𝑗 ∈ ∅ ∨ ¬ 𝑗 ∈ ∅) |
| 15 | df-dc 843 | . . . . . . 7 ⊢ (DECID 𝑗 ∈ ∅ ↔ (𝑗 ∈ ∅ ∨ ¬ 𝑗 ∈ ∅)) | |
| 16 | 14, 15 | mpbir 146 | . . . . . 6 ⊢ DECID 𝑗 ∈ ∅ |
| 17 | 16 | rgenw 2599 | . . . . 5 ⊢ ∀𝑗 ∈ ℕ DECID 𝑗 ∈ ∅ |
| 18 | 17 | a1i 9 | . . . 4 ⊢ (⊤ → ∀𝑗 ∈ ℕ DECID 𝑗 ∈ ∅) |
| 19 | 10 | pm2.21i 651 | . . . . 5 ⊢ (𝑘 ∈ ∅ → 𝐴 ∈ ℂ) |
| 20 | 19 | adantl 277 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ∅) → 𝐴 ∈ ℂ) |
| 21 | 1, 2, 4, 12, 18, 20 | zsumdc 12095 | . . 3 ⊢ (⊤ → Σ𝑘 ∈ ∅ 𝐴 = ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0})))) |
| 22 | 21 | mptru 1407 | . 2 ⊢ Σ𝑘 ∈ ∅ 𝐴 = ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0}))) |
| 23 | fclim 12004 | . . . 4 ⊢ ⇝ :dom ⇝ ⟶ℂ | |
| 24 | ffun 5516 | . . . 4 ⊢ ( ⇝ :dom ⇝ ⟶ℂ → Fun ⇝ ) | |
| 25 | 23, 24 | ax-mp 5 | . . 3 ⊢ Fun ⇝ |
| 26 | 1z 9620 | . . . 4 ⊢ 1 ∈ ℤ | |
| 27 | serclim0 12015 | . . . 4 ⊢ (1 ∈ ℤ → seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0) | |
| 28 | 26, 27 | ax-mp 5 | . . 3 ⊢ seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0 |
| 29 | funbrfv 5718 | . . 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 2255 | 1 ⊢ Σ𝑘 ∈ ∅ 𝐴 = 0 |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 ∨ wo 716 DECID wdc 842 = wceq 1398 ⊤wtru 1399 ∈ wcel 2205 ∀wral 2522 ⊆ wss 3214 ∅c0 3512 ifcif 3624 {csn 3694 class class class wbr 4114 × cxp 4752 dom cdm 4754 Fun wfun 5351 ⟶wf 5353 ‘cfv 5357 ℂcc 8141 0cc0 8143 1c1 8144 + caddc 8146 ℕcn 9254 ℤcz 9594 ℤ≥cuz 9871 seqcseq 10833 ⇝ cli 11988 Σcsu 12063 |
| 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-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 ax-arch 8262 ax-caucvg 8263 |
| This theorem depends on definitions: df-bi 117 df-dc 843 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-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-isom 5366 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-frec 6635 df-1o 6660 df-oadd 6664 df-er 6780 df-en 6989 df-dom 6990 df-fin 6991 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-2 9313 df-3 9314 df-4 9315 df-n0 9514 df-z 9595 df-uz 9872 df-q 9970 df-rp 10005 df-fz 10362 df-fzo 10499 df-seqfrec 10834 df-exp 10925 df-ihash 11164 df-cj 11552 df-re 11553 df-im 11554 df-rsqrt 11708 df-abs 11709 df-clim 11989 df-sumdc 12064 |
| This theorem is referenced by: isumz 12100 fsumf1o 12101 fsumcllem 12110 fsumadd 12117 fsum2d 12146 fisumrev2 12157 fsummulc2 12159 fsumconst 12165 modfsummod 12169 fsumabs 12176 telfsumo 12177 fsumparts 12181 fsumrelem 12182 fsumiun 12188 isumsplit 12202 arisum 12209 arisum2 12210 cvgratnnlemseq 12237 bitsinv1 12673 gsumfzfsumlem0 14846 fsumcncntop 15544 dvmptfsum 15702 |
| Copyright terms: Public domain | W3C validator |