| 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 12878 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 7 | peano2uz 12926 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
| 8 | 6, 7 | syl 18 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
| 9 | gsumprval.f | . . . 4 ⊢ (𝜑 → 𝐹:{𝑀, 𝑁}⟶𝐵) | |
| 10 | fzpr 13609 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) | |
| 11 | 4, 10 | syl 18 | . . . . . 6 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) |
| 12 | gsumprval.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 = (𝑀 + 1)) | |
| 13 | 12 | eqcomd 2769 | . . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) = 𝑁) |
| 14 | 13 | preq2d 4707 | . . . . . 6 ⊢ (𝜑 → {𝑀, (𝑀 + 1)} = {𝑀, 𝑁}) |
| 15 | 11, 14 | eqtrd 2798 | . . . . 5 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, 𝑁}) |
| 16 | 15 | feq2d 6691 | . . . 4 ⊢ (𝜑 → (𝐹:(𝑀...(𝑀 + 1))⟶𝐵 ↔ 𝐹:{𝑀, 𝑁}⟶𝐵)) |
| 17 | 9, 16 | mpbird 260 | . . 3 ⊢ (𝜑 → 𝐹:(𝑀...(𝑀 + 1))⟶𝐵) |
| 18 | 1, 2, 3, 8, 17 | gsumval2 18745 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (seq𝑀( + , 𝐹)‘(𝑀 + 1))) |
| 19 | seqp1 14054 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) | |
| 20 | 6, 19 | syl 18 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) |
| 21 | seq1 14052 | . . . 4 ⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) | |
| 22 | 4, 21 | syl 18 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
| 23 | 13 | fveq2d 6887 | . . 3 ⊢ (𝜑 → (𝐹‘(𝑀 + 1)) = (𝐹‘𝑁)) |
| 24 | 22, 23 | oveq12d 7430 | . 2 ⊢ (𝜑 → ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| 25 | 18, 20, 24 | 3eqtrd 2802 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 {cpr 4592 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 1c1 11102 + caddc 11104 ℤcz 12592 ℤ≥cuz 12863 ...cfz 13536 seqcseq 14039 Basecbs 17270 +gcplusg 17311 Σg cgsu 17494 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-n0 12506 df-z 12593 df-uz 12864 df-fz 13537 df-seq 14040 df-0g 17495 df-gsum 17496 |
| This theorem is referenced by: gsumpr12val 18748 |
| Copyright terms: Public domain | W3C validator |