![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gsumprval | Structured version Visualization version GIF version |
Description: Value of the group sum operation over a pair of sequential integers. (Contributed by AV, 14-Dec-2018.) |
Ref | Expression |
---|---|
gsumprval.b | ⊢ 𝐵 = (Base‘𝐺) |
gsumprval.p | ⊢ + = (+g‘𝐺) |
gsumprval.g | ⊢ (𝜑 → 𝐺 ∈ 𝑉) |
gsumprval.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
gsumprval.n | ⊢ (𝜑 → 𝑁 = (𝑀 + 1)) |
gsumprval.f | ⊢ (𝜑 → 𝐹:{𝑀, 𝑁}⟶𝐵) |
Ref | Expression |
---|---|
gsumprval | ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsumprval.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | gsumprval.p | . . 3 ⊢ + = (+g‘𝐺) | |
3 | gsumprval.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
4 | gsumprval.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
5 | uzid 11944 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
7 | peano2uz 11984 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
9 | gsumprval.f | . . . 4 ⊢ (𝜑 → 𝐹:{𝑀, 𝑁}⟶𝐵) | |
10 | fzpr 12649 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) | |
11 | 4, 10 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) |
12 | gsumprval.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 = (𝑀 + 1)) | |
13 | 12 | eqcomd 2806 | . . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) = 𝑁) |
14 | 13 | preq2d 4465 | . . . . . 6 ⊢ (𝜑 → {𝑀, (𝑀 + 1)} = {𝑀, 𝑁}) |
15 | 11, 14 | eqtrd 2834 | . . . . 5 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, 𝑁}) |
16 | 15 | feq2d 6243 | . . . 4 ⊢ (𝜑 → (𝐹:(𝑀...(𝑀 + 1))⟶𝐵 ↔ 𝐹:{𝑀, 𝑁}⟶𝐵)) |
17 | 9, 16 | mpbird 249 | . . 3 ⊢ (𝜑 → 𝐹:(𝑀...(𝑀 + 1))⟶𝐵) |
18 | 1, 2, 3, 8, 17 | gsumval2 17594 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (seq𝑀( + , 𝐹)‘(𝑀 + 1))) |
19 | seqp1 13069 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) | |
20 | 6, 19 | syl 17 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) |
21 | seq1 13067 | . . . 4 ⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) | |
22 | 4, 21 | syl 17 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
23 | 13 | fveq2d 6416 | . . 3 ⊢ (𝜑 → (𝐹‘(𝑀 + 1)) = (𝐹‘𝑁)) |
24 | 22, 23 | oveq12d 6897 | . 2 ⊢ (𝜑 → ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
25 | 18, 20, 24 | 3eqtrd 2838 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1653 ∈ wcel 2157 {cpr 4371 ⟶wf 6098 ‘cfv 6102 (class class class)co 6879 1c1 10226 + caddc 10228 ℤcz 11665 ℤ≥cuz 11929 ...cfz 12579 seqcseq 13054 Basecbs 16183 +gcplusg 16266 Σg cgsu 16415 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2378 ax-ext 2778 ax-sep 4976 ax-nul 4984 ax-pow 5036 ax-pr 5098 ax-un 7184 ax-cnex 10281 ax-resscn 10282 ax-1cn 10283 ax-icn 10284 ax-addcl 10285 ax-addrcl 10286 ax-mulcl 10287 ax-mulrcl 10288 ax-mulcom 10289 ax-addass 10290 ax-mulass 10291 ax-distr 10292 ax-i2m1 10293 ax-1ne0 10294 ax-1rid 10295 ax-rnegex 10296 ax-rrecex 10297 ax-cnre 10298 ax-pre-lttri 10299 ax-pre-lttrn 10300 ax-pre-ltadd 10301 ax-pre-mulgt0 10302 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2592 df-eu 2610 df-clab 2787 df-cleq 2793 df-clel 2796 df-nfc 2931 df-ne 2973 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3388 df-sbc 3635 df-csb 3730 df-dif 3773 df-un 3775 df-in 3777 df-ss 3784 df-pss 3786 df-nul 4117 df-if 4279 df-pw 4352 df-sn 4370 df-pr 4372 df-tp 4374 df-op 4376 df-uni 4630 df-iun 4713 df-br 4845 df-opab 4907 df-mpt 4924 df-tr 4947 df-id 5221 df-eprel 5226 df-po 5234 df-so 5235 df-fr 5272 df-we 5274 df-xp 5319 df-rel 5320 df-cnv 5321 df-co 5322 df-dm 5323 df-rn 5324 df-res 5325 df-ima 5326 df-pred 5899 df-ord 5945 df-on 5946 df-lim 5947 df-suc 5948 df-iota 6065 df-fun 6104 df-fn 6105 df-f 6106 df-f1 6107 df-fo 6108 df-f1o 6109 df-fv 6110 df-riota 6840 df-ov 6882 df-oprab 6883 df-mpt2 6884 df-om 7301 df-1st 7402 df-2nd 7403 df-wrecs 7646 df-recs 7708 df-rdg 7746 df-er 7983 df-en 8197 df-dom 8198 df-sdom 8199 df-pnf 10366 df-mnf 10367 df-xr 10368 df-ltxr 10369 df-le 10370 df-sub 10559 df-neg 10560 df-nn 11314 df-n0 11580 df-z 11666 df-uz 11930 df-fz 12580 df-seq 13055 df-0g 16416 df-gsum 16417 |
This theorem is referenced by: gsumpr12val 17596 |
Copyright terms: Public domain | W3C validator |