![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sumsnd | Structured version Visualization version GIF version |
Description: A sum of a singleton is the term. The deduction version of sumsn 15093. (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
Ref | Expression |
---|---|
sumsnd.1 | ⊢ (𝜑 → Ⅎ𝑘𝐵) |
sumsnd.2 | ⊢ Ⅎ𝑘𝜑 |
sumsnd.3 | ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐵) |
sumsnd.4 | ⊢ (𝜑 → 𝑀 ∈ 𝑉) |
sumsnd.5 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
Ref | Expression |
---|---|
sumsnd | ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2955 | . . . 4 ⊢ Ⅎ𝑚𝐴 | |
2 | nfcsb1v 3852 | . . . 4 ⊢ Ⅎ𝑘⦋𝑚 / 𝑘⦌𝐴 | |
3 | csbeq1a 3842 | . . . 4 ⊢ (𝑘 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑘⦌𝐴) | |
4 | 1, 2, 3 | cbvsumi 15046 | . . 3 ⊢ Σ𝑘 ∈ {𝑀}𝐴 = Σ𝑚 ∈ {𝑀}⦋𝑚 / 𝑘⦌𝐴 |
5 | csbeq1 3831 | . . . 4 ⊢ (𝑚 = ({〈1, 𝑀〉}‘𝑛) → ⦋𝑚 / 𝑘⦌𝐴 = ⦋({〈1, 𝑀〉}‘𝑛) / 𝑘⦌𝐴) | |
6 | 1nn 11636 | . . . . 5 ⊢ 1 ∈ ℕ | |
7 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 1 ∈ ℕ) |
8 | sumsnd.4 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
9 | f1osng 6630 | . . . . . 6 ⊢ ((1 ∈ ℕ ∧ 𝑀 ∈ 𝑉) → {〈1, 𝑀〉}:{1}–1-1-onto→{𝑀}) | |
10 | 6, 8, 9 | sylancr 590 | . . . . 5 ⊢ (𝜑 → {〈1, 𝑀〉}:{1}–1-1-onto→{𝑀}) |
11 | 1z 12000 | . . . . . 6 ⊢ 1 ∈ ℤ | |
12 | fzsn 12944 | . . . . . 6 ⊢ (1 ∈ ℤ → (1...1) = {1}) | |
13 | f1oeq2 6580 | . . . . . 6 ⊢ ((1...1) = {1} → ({〈1, 𝑀〉}:(1...1)–1-1-onto→{𝑀} ↔ {〈1, 𝑀〉}:{1}–1-1-onto→{𝑀})) | |
14 | 11, 12, 13 | mp2b 10 | . . . . 5 ⊢ ({〈1, 𝑀〉}:(1...1)–1-1-onto→{𝑀} ↔ {〈1, 𝑀〉}:{1}–1-1-onto→{𝑀}) |
15 | 10, 14 | sylibr 237 | . . . 4 ⊢ (𝜑 → {〈1, 𝑀〉}:(1...1)–1-1-onto→{𝑀}) |
16 | elsni 4542 | . . . . . . 7 ⊢ (𝑚 ∈ {𝑀} → 𝑚 = 𝑀) | |
17 | 16 | adantl 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → 𝑚 = 𝑀) |
18 | 17 | csbeq1d 3832 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑚 / 𝑘⦌𝐴 = ⦋𝑀 / 𝑘⦌𝐴) |
19 | sumsnd.2 | . . . . . . . 8 ⊢ Ⅎ𝑘𝜑 | |
20 | sumsnd.1 | . . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑘𝐵) | |
21 | sumsnd.3 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐵) | |
22 | 19, 20, 8, 21 | csbiedf 3858 | . . . . . . 7 ⊢ (𝜑 → ⦋𝑀 / 𝑘⦌𝐴 = 𝐵) |
23 | 22 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑀 / 𝑘⦌𝐴 = 𝐵) |
24 | sumsnd.5 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
25 | 24 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → 𝐵 ∈ ℂ) |
26 | 23, 25 | eqeltrd 2890 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑀 / 𝑘⦌𝐴 ∈ ℂ) |
27 | 18, 26 | eqeltrd 2890 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑚 / 𝑘⦌𝐴 ∈ ℂ) |
28 | 22 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ⦋𝑀 / 𝑘⦌𝐴 = 𝐵) |
29 | elfz1eq 12913 | . . . . . . . 8 ⊢ (𝑛 ∈ (1...1) → 𝑛 = 1) | |
30 | 29 | fveq2d 6649 | . . . . . . 7 ⊢ (𝑛 ∈ (1...1) → ({〈1, 𝑀〉}‘𝑛) = ({〈1, 𝑀〉}‘1)) |
31 | fvsng 6919 | . . . . . . . 8 ⊢ ((1 ∈ ℕ ∧ 𝑀 ∈ 𝑉) → ({〈1, 𝑀〉}‘1) = 𝑀) | |
32 | 6, 8, 31 | sylancr 590 | . . . . . . 7 ⊢ (𝜑 → ({〈1, 𝑀〉}‘1) = 𝑀) |
33 | 30, 32 | sylan9eqr 2855 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ({〈1, 𝑀〉}‘𝑛) = 𝑀) |
34 | 33 | csbeq1d 3832 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ⦋({〈1, 𝑀〉}‘𝑛) / 𝑘⦌𝐴 = ⦋𝑀 / 𝑘⦌𝐴) |
35 | 29 | fveq2d 6649 | . . . . . 6 ⊢ (𝑛 ∈ (1...1) → ({〈1, 𝐵〉}‘𝑛) = ({〈1, 𝐵〉}‘1)) |
36 | fvsng 6919 | . . . . . . 7 ⊢ ((1 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ({〈1, 𝐵〉}‘1) = 𝐵) | |
37 | 6, 24, 36 | sylancr 590 | . . . . . 6 ⊢ (𝜑 → ({〈1, 𝐵〉}‘1) = 𝐵) |
38 | 35, 37 | sylan9eqr 2855 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ({〈1, 𝐵〉}‘𝑛) = 𝐵) |
39 | 28, 34, 38 | 3eqtr4rd 2844 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ({〈1, 𝐵〉}‘𝑛) = ⦋({〈1, 𝑀〉}‘𝑛) / 𝑘⦌𝐴) |
40 | 5, 7, 15, 27, 39 | fsum 15069 | . . 3 ⊢ (𝜑 → Σ𝑚 ∈ {𝑀}⦋𝑚 / 𝑘⦌𝐴 = (seq1( + , {〈1, 𝐵〉})‘1)) |
41 | 4, 40 | syl5eq 2845 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐴 = (seq1( + , {〈1, 𝐵〉})‘1)) |
42 | 11, 37 | seq1i 13378 | . 2 ⊢ (𝜑 → (seq1( + , {〈1, 𝐵〉})‘1) = 𝐵) |
43 | 41, 42 | eqtrd 2833 | 1 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 Ⅎwnf 1785 ∈ wcel 2111 Ⅎwnfc 2936 ⦋csb 3828 {csn 4525 〈cop 4531 –1-1-onto→wf1o 6323 ‘cfv 6324 (class class class)co 7135 ℂcc 10524 1c1 10527 + caddc 10529 ℕcn 11625 ℤcz 11969 ...cfz 12885 seqcseq 13364 Σcsu 15034 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-inf2 9088 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-se 5479 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-isom 6333 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-oi 8958 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-seq 13365 df-exp 13426 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-sum 15035 |
This theorem is referenced by: sumpair 41664 dvnmul 42585 sge0sn 43018 hoidmvlelem3 43236 |
Copyright terms: Public domain | W3C validator |