| 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 12848 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
| 7 | peano2uz 12896 | . . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝑀)) |
| 9 | gsumprval.f | . . . 4 ⊢ (𝜑 → 𝐹:{𝑀, 𝑁}⟶𝐵) | |
| 10 | fzpr 13578 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) | |
| 11 | 4, 10 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) |
| 12 | gsumprval.n | . . . . . . . 8 ⊢ (𝜑 → 𝑁 = (𝑀 + 1)) | |
| 13 | 12 | eqcomd 2767 | . . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) = 𝑁) |
| 14 | 13 | preq2d 4696 | . . . . . 6 ⊢ (𝜑 → {𝑀, (𝑀 + 1)} = {𝑀, 𝑁}) |
| 15 | 11, 14 | eqtrd 2796 | . . . . 5 ⊢ (𝜑 → (𝑀...(𝑀 + 1)) = {𝑀, 𝑁}) |
| 16 | 15 | feq2d 6670 | . . . 4 ⊢ (𝜑 → (𝐹:(𝑀...(𝑀 + 1))⟶𝐵 ↔ 𝐹:{𝑀, 𝑁}⟶𝐵)) |
| 17 | 9, 16 | mpbird 259 | . . 3 ⊢ (𝜑 → 𝐹:(𝑀...(𝑀 + 1))⟶𝐵) |
| 18 | 1, 2, 3, 8, 17 | gsumval2 18711 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (seq𝑀( + , 𝐹)‘(𝑀 + 1))) |
| 19 | seqp1 14023 | . . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) | |
| 20 | 6, 19 | syl 17 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑀 + 1)) = ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1)))) |
| 21 | seq1 14021 | . . . 4 ⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) | |
| 22 | 4, 21 | syl 17 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
| 23 | 13 | fveq2d 6866 | . . 3 ⊢ (𝜑 → (𝐹‘(𝑀 + 1)) = (𝐹‘𝑁)) |
| 24 | 22, 23 | oveq12d 7409 | . 2 ⊢ (𝜑 → ((seq𝑀( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| 25 | 18, 20, 24 | 3eqtrd 2800 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐹‘𝑀) + (𝐹‘𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 {cpr 4581 ⟶wf 6512 ‘cfv 6516 (class class class)co 7391 1c1 11068 + caddc 11070 ℤcz 12562 ℤ≥cuz 12833 ...cfz 13506 seqcseq 14008 Basecbs 17236 +gcplusg 17277 Σg cgsu 17460 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-seq 14009 df-0g 17461 df-gsum 17462 |
| This theorem is referenced by: gsumpr12val 18714 |
| Copyright terms: Public domain | W3C validator |