| 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 12766 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 7 | peano2uz 12814 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
| 9 | gsumprval.f | . . . 4 ⊢ (𝜑 → 𝐹:{𝑀, 𝑁}⟶𝐵) | |
| 10 | fzpr 13495 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) | |
| 11 | 4, 10 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) |
| 12 | gsumprval.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 = (𝑀 + 1)) | |
| 13 | 12 | eqcomd 2742 | . . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) = 𝑁) |
| 14 | 13 | preq2d 4697 | . . . . . 6 ⊢ (𝜑 → {𝑀, (𝑀 + 1)} = {𝑀, 𝑁}) |
| 15 | 11, 14 | eqtrd 2771 | . . . . 5 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, 𝑁}) |
| 16 | 15 | feq2d 6646 | . . . 4 ⊢ (𝜑 → (𝐹:(𝑀...(𝑀 + 1))⟶𝐵 ↔ 𝐹:{𝑀, 𝑁}⟶𝐵)) |
| 17 | 9, 16 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐹:(𝑀...(𝑀 + 1))⟶𝐵) |
| 18 | 1, 2, 3, 8, 17 | gsumval2 18611 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (seq𝑀( + , 𝐹)‘(𝑀 + 1))) |
| 19 | seqp1 13939 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) | |
| 20 | 6, 19 | syl 17 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) |
| 21 | seq1 13937 | . . . 4 ⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) | |
| 22 | 4, 21 | syl 17 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
| 23 | 13 | fveq2d 6838 | . . 3 ⊢ (𝜑 → (𝐹‘(𝑀 + 1)) = (𝐹‘𝑁)) |
| 24 | 22, 23 | oveq12d 7376 | . 2 ⊢ (𝜑 → ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| 25 | 18, 20, 24 | 3eqtrd 2775 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 {cpr 4582 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 1c1 11027 + caddc 11029 ℤcz 12488 ℤ≥cuz 12751 ...cfz 13423 seqcseq 13924 Basecbs 17136 +gcplusg 17177 Σg cgsu 17360 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-seq 13925 df-0g 17361 df-gsum 17362 |
| This theorem is referenced by: gsumpr12val 18614 |
| Copyright terms: Public domain | W3C validator |