| 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 9656 | . . . 4 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 9372 | . . . 4 ⊢ (⊤ → 1 ∈ ℤ) | |
| 3 | 0ss 3490 | . . . . 5 ⊢ ∅ ⊆ ℕ | |
| 4 | 3 | a1i 9 | . . . 4 ⊢ (⊤ → ∅ ⊆ ℕ) |
| 5 | simpr 110 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 6 | 5, 1 | eleqtrdi 2289 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1)) |
| 7 | c0ex 8039 | . . . . . . 7 ⊢ 0 ∈ V | |
| 8 | 7 | fvconst2 5781 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘1) → (((ℤ≥‘1) × {0})‘𝑘) = 0) |
| 9 | 6, 8 | syl 14 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (((ℤ≥‘1) × {0})‘𝑘) = 0) |
| 10 | noel 3455 | . . . . . 6 ⊢ ¬ 𝑘 ∈ ∅ | |
| 11 | 10 | iffalsei 3571 | . . . . 5 ⊢ if(𝑘 ∈ ∅, 𝐴, 0) = 0 |
| 12 | 9, 11 | eqtr4di 2247 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ℕ) → (((ℤ≥‘1) × {0})‘𝑘) = if(𝑘 ∈ ∅, 𝐴, 0)) |
| 13 | noel 3455 | . . . . . . . 8 ⊢ ¬ 𝑗 ∈ ∅ | |
| 14 | 13 | olci 733 | . . . . . . 7 ⊢ (𝑗 ∈ ∅ ∨ ¬ 𝑗 ∈ ∅) |
| 15 | df-dc 836 | . . . . . . 7 ⊢ (DECID 𝑗 ∈ ∅ ↔ (𝑗 ∈ ∅ ∨ ¬ 𝑗 ∈ ∅)) | |
| 16 | 14, 15 | mpbir 146 | . . . . . 6 ⊢ DECID 𝑗 ∈ ∅ |
| 17 | 16 | rgenw 2552 | . . . . 5 ⊢ ∀𝑗 ∈ ℕ DECID 𝑗 ∈ ∅ |
| 18 | 17 | a1i 9 | . . . 4 ⊢ (⊤ → ∀𝑗 ∈ ℕ DECID 𝑗 ∈ ∅) |
| 19 | 10 | pm2.21i 647 | . . . . 5 ⊢ (𝑘 ∈ ∅ → 𝐴 ∈ ℂ) |
| 20 | 19 | adantl 277 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ ∅) → 𝐴 ∈ ℂ) |
| 21 | 1, 2, 4, 12, 18, 20 | zsumdc 11568 | . . 3 ⊢ (⊤ → Σ𝑘 ∈ ∅ 𝐴 = ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0})))) |
| 22 | 21 | mptru 1373 | . 2 ⊢ Σ𝑘 ∈ ∅ 𝐴 = ( ⇝ ‘seq1( + , ((ℤ≥‘1) × {0}))) |
| 23 | fclim 11478 | . . . 4 ⊢ ⇝ :dom ⇝ ⟶ℂ | |
| 24 | ffun 5413 | . . . 4 ⊢ ( ⇝ :dom ⇝ ⟶ℂ → Fun ⇝ ) | |
| 25 | 23, 24 | ax-mp 5 | . . 3 ⊢ Fun ⇝ |
| 26 | 1z 9371 | . . . 4 ⊢ 1 ∈ ℤ | |
| 27 | serclim0 11489 | . . . 4 ⊢ (1 ∈ ℤ → seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0) | |
| 28 | 26, 27 | ax-mp 5 | . . 3 ⊢ seq1( + , ((ℤ≥‘1) × {0})) ⇝ 0 |
| 29 | funbrfv 5602 | . . 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 2217 | 1 ⊢ Σ𝑘 ∈ ∅ 𝐴 = 0 |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 ∨ wo 709 DECID wdc 835 = wceq 1364 ⊤wtru 1365 ∈ wcel 2167 ∀wral 2475 ⊆ wss 3157 ∅c0 3451 ifcif 3562 {csn 3623 class class class wbr 4034 × cxp 4662 dom cdm 4664 Fun wfun 5253 ⟶wf 5255 ‘cfv 5259 ℂcc 7896 0cc0 7898 1c1 7899 + caddc 7901 ℕcn 9009 ℤcz 9345 ℤ≥cuz 9620 seqcseq 10558 ⇝ cli 11462 Σcsu 11537 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7989 ax-resscn 7990 ax-1cn 7991 ax-1re 7992 ax-icn 7993 ax-addcl 7994 ax-addrcl 7995 ax-mulcl 7996 ax-mulrcl 7997 ax-addcom 7998 ax-mulcom 7999 ax-addass 8000 ax-mulass 8001 ax-distr 8002 ax-i2m1 8003 ax-0lt1 8004 ax-1rid 8005 ax-0id 8006 ax-rnegex 8007 ax-precex 8008 ax-cnre 8009 ax-pre-ltirr 8010 ax-pre-ltwlin 8011 ax-pre-lttrn 8012 ax-pre-apti 8013 ax-pre-ltadd 8014 ax-pre-mulgt0 8015 ax-pre-mulext 8016 ax-arch 8017 ax-caucvg 8018 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-isom 5268 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-frec 6458 df-1o 6483 df-oadd 6487 df-er 6601 df-en 6809 df-dom 6810 df-fin 6811 df-pnf 8082 df-mnf 8083 df-xr 8084 df-ltxr 8085 df-le 8086 df-sub 8218 df-neg 8219 df-reap 8621 df-ap 8628 df-div 8719 df-inn 9010 df-2 9068 df-3 9069 df-4 9070 df-n0 9269 df-z 9346 df-uz 9621 df-q 9713 df-rp 9748 df-fz 10103 df-fzo 10237 df-seqfrec 10559 df-exp 10650 df-ihash 10887 df-cj 11026 df-re 11027 df-im 11028 df-rsqrt 11182 df-abs 11183 df-clim 11463 df-sumdc 11538 |
| This theorem is referenced by: isumz 11573 fsumf1o 11574 fsumcllem 11583 fsumadd 11590 fsum2d 11619 fisumrev2 11630 fsummulc2 11632 fsumconst 11638 modfsummod 11642 fsumabs 11649 telfsumo 11650 fsumparts 11654 fsumrelem 11655 fsumiun 11661 isumsplit 11675 arisum 11682 arisum2 11683 cvgratnnlemseq 11710 bitsinv1 12146 gsumfzfsumlem0 14220 fsumcncntop 14911 dvmptfsum 15069 |
| Copyright terms: Public domain | W3C validator |