![]() |
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 15779. (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 | csbeq1a 3922 | . . . 4 ⊢ (𝑘 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑘⦌𝐴) | |
2 | nfcv 2903 | . . . 4 ⊢ Ⅎ𝑚𝐴 | |
3 | nfcsb1v 3933 | . . . 4 ⊢ Ⅎ𝑘⦋𝑚 / 𝑘⦌𝐴 | |
4 | 1, 2, 3 | cbvsum 15728 | . . 3 ⊢ Σ𝑘 ∈ {𝑀}𝐴 = Σ𝑚 ∈ {𝑀}⦋𝑚 / 𝑘⦌𝐴 |
5 | csbeq1 3911 | . . . 4 ⊢ (𝑚 = ({〈1, 𝑀〉}‘𝑛) → ⦋𝑚 / 𝑘⦌𝐴 = ⦋({〈1, 𝑀〉}‘𝑛) / 𝑘⦌𝐴) | |
6 | 1nn 12275 | . . . . 5 ⊢ 1 ∈ ℕ | |
7 | 6 | a1i 11 | . . . 4 ⊢ (𝜑 → 1 ∈ ℕ) |
8 | sumsnd.4 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑉) | |
9 | f1osng 6890 | . . . . . 6 ⊢ ((1 ∈ ℕ ∧ 𝑀 ∈ 𝑉) → {〈1, 𝑀〉}:{1}–1-1-onto→{𝑀}) | |
10 | 6, 8, 9 | sylancr 587 | . . . . 5 ⊢ (𝜑 → {〈1, 𝑀〉}:{1}–1-1-onto→{𝑀}) |
11 | 1z 12645 | . . . . . 6 ⊢ 1 ∈ ℤ | |
12 | fzsn 13603 | . . . . . 6 ⊢ (1 ∈ ℤ → (1...1) = {1}) | |
13 | f1oeq2 6838 | . . . . . 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 234 | . . . 4 ⊢ (𝜑 → {〈1, 𝑀〉}:(1...1)–1-1-onto→{𝑀}) |
16 | elsni 4648 | . . . . . . 7 ⊢ (𝑚 ∈ {𝑀} → 𝑚 = 𝑀) | |
17 | 16 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → 𝑚 = 𝑀) |
18 | 17 | csbeq1d 3912 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑚 / 𝑘⦌𝐴 = ⦋𝑀 / 𝑘⦌𝐴) |
19 | sumsnd.2 | . . . . . . . 8 ⊢ Ⅎ𝑘𝜑 | |
20 | sumsnd.1 | . . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑘𝐵) | |
21 | sumsnd.3 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 = 𝑀) → 𝐴 = 𝐵) | |
22 | 19, 20, 8, 21 | csbiedf 3939 | . . . . . . 7 ⊢ (𝜑 → ⦋𝑀 / 𝑘⦌𝐴 = 𝐵) |
23 | 22 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑀 / 𝑘⦌𝐴 = 𝐵) |
24 | sumsnd.5 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
25 | 24 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → 𝐵 ∈ ℂ) |
26 | 23, 25 | eqeltrd 2839 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑀 / 𝑘⦌𝐴 ∈ ℂ) |
27 | 18, 26 | eqeltrd 2839 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ {𝑀}) → ⦋𝑚 / 𝑘⦌𝐴 ∈ ℂ) |
28 | 22 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ⦋𝑀 / 𝑘⦌𝐴 = 𝐵) |
29 | elfz1eq 13572 | . . . . . . . 8 ⊢ (𝑛 ∈ (1...1) → 𝑛 = 1) | |
30 | 29 | fveq2d 6911 | . . . . . . 7 ⊢ (𝑛 ∈ (1...1) → ({〈1, 𝑀〉}‘𝑛) = ({〈1, 𝑀〉}‘1)) |
31 | fvsng 7200 | . . . . . . . 8 ⊢ ((1 ∈ ℕ ∧ 𝑀 ∈ 𝑉) → ({〈1, 𝑀〉}‘1) = 𝑀) | |
32 | 6, 8, 31 | sylancr 587 | . . . . . . 7 ⊢ (𝜑 → ({〈1, 𝑀〉}‘1) = 𝑀) |
33 | 30, 32 | sylan9eqr 2797 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ({〈1, 𝑀〉}‘𝑛) = 𝑀) |
34 | 33 | csbeq1d 3912 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ⦋({〈1, 𝑀〉}‘𝑛) / 𝑘⦌𝐴 = ⦋𝑀 / 𝑘⦌𝐴) |
35 | 29 | fveq2d 6911 | . . . . . 6 ⊢ (𝑛 ∈ (1...1) → ({〈1, 𝐵〉}‘𝑛) = ({〈1, 𝐵〉}‘1)) |
36 | fvsng 7200 | . . . . . . 7 ⊢ ((1 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ({〈1, 𝐵〉}‘1) = 𝐵) | |
37 | 6, 24, 36 | sylancr 587 | . . . . . 6 ⊢ (𝜑 → ({〈1, 𝐵〉}‘1) = 𝐵) |
38 | 35, 37 | sylan9eqr 2797 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ({〈1, 𝐵〉}‘𝑛) = 𝐵) |
39 | 28, 34, 38 | 3eqtr4rd 2786 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...1)) → ({〈1, 𝐵〉}‘𝑛) = ⦋({〈1, 𝑀〉}‘𝑛) / 𝑘⦌𝐴) |
40 | 5, 7, 15, 27, 39 | fsum 15753 | . . 3 ⊢ (𝜑 → Σ𝑚 ∈ {𝑀}⦋𝑚 / 𝑘⦌𝐴 = (seq1( + , {〈1, 𝐵〉})‘1)) |
41 | 4, 40 | eqtrid 2787 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐴 = (seq1( + , {〈1, 𝐵〉})‘1)) |
42 | 11, 37 | seq1i 14053 | . 2 ⊢ (𝜑 → (seq1( + , {〈1, 𝐵〉})‘1) = 𝐵) |
43 | 41, 42 | eqtrd 2775 | 1 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 Ⅎwnf 1780 ∈ wcel 2106 Ⅎwnfc 2888 ⦋csb 3908 {csn 4631 〈cop 4637 –1-1-onto→wf1o 6562 ‘cfv 6563 (class class class)co 7431 ℂcc 11151 1c1 11154 + caddc 11156 ℕcn 12264 ℤcz 12611 ...cfz 13544 seqcseq 14039 Σcsu 15719 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-inf2 9679 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-fz 13545 df-fzo 13692 df-seq 14040 df-exp 14100 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-clim 15521 df-sum 15720 |
This theorem is referenced by: sumpair 44973 dvnmul 45899 sge0sn 46335 hoidmvlelem3 46553 |
Copyright terms: Public domain | W3C validator |