| 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 12872 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 7 | peano2uz 12922 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
| 9 | gsumprval.f | . . . 4 ⊢ (𝜑 → 𝐹:{𝑀, 𝑁}⟶𝐵) | |
| 10 | fzpr 13601 | . . . . . . 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 4721 | . . . . . 6 ⊢ (𝜑 → {𝑀, (𝑀 + 1)} = {𝑀, 𝑁}) |
| 15 | 11, 14 | eqtrd 2771 | . . . . 5 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, 𝑁}) |
| 16 | 15 | feq2d 6697 | . . . 4 ⊢ (𝜑 → (𝐹:(𝑀...(𝑀 + 1))⟶𝐵 ↔ 𝐹:{𝑀, 𝑁}⟶𝐵)) |
| 17 | 9, 16 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐹:(𝑀...(𝑀 + 1))⟶𝐵) |
| 18 | 1, 2, 3, 8, 17 | gsumval2 18669 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (seq𝑀( + , 𝐹)‘(𝑀 + 1))) |
| 19 | seqp1 14039 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) | |
| 20 | 6, 19 | syl 17 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) |
| 21 | seq1 14037 | . . . 4 ⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) | |
| 22 | 4, 21 | syl 17 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
| 23 | 13 | fveq2d 6885 | . . 3 ⊢ (𝜑 → (𝐹‘(𝑀 + 1)) = (𝐹‘𝑁)) |
| 24 | 22, 23 | oveq12d 7428 | . 2 ⊢ (𝜑 → ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| 25 | 18, 20, 24 | 3eqtrd 2775 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 {cpr 4608 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 1c1 11135 + caddc 11137 ℤcz 12593 ℤ≥cuz 12857 ...cfz 13529 seqcseq 14024 Basecbs 17233 +gcplusg 17276 Σg cgsu 17459 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-n0 12507 df-z 12594 df-uz 12858 df-fz 13530 df-seq 14025 df-0g 17460 df-gsum 17461 |
| This theorem is referenced by: gsumpr12val 18672 |
| Copyright terms: Public domain | W3C validator |