| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsummptfzcl | Structured version Visualization version GIF version | ||
| Description: Closure of a finite group sum over a finite set of sequential integers as map. (Contributed by AV, 14-Dec-2018.) |
| Ref | Expression |
|---|---|
| gsummptfzcl.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsummptfzcl.g | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| gsummptfzcl.n | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| gsummptfzcl.i | ⊢ (𝜑 → 𝐼 = (𝑀...𝑁)) |
| gsummptfzcl.e | ⊢ (𝜑 → ∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| gsummptfzcl | ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ 𝐼 ↦ 𝑋)) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsummptfzcl.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2734 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | gsummptfzcl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 4 | gsummptfzcl.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 5 | gsummptfzcl.e | . . . 4 ⊢ (𝜑 → ∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵) | |
| 6 | eqid 2734 | . . . . . 6 ⊢ (𝑖 ∈ 𝐼 ↦ 𝑋) = (𝑖 ∈ 𝐼 ↦ 𝑋) | |
| 7 | 6 | fmpt 7053 | . . . . 5 ⊢ (∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵 ↔ (𝑖 ∈ 𝐼 ↦ 𝑋):𝐼⟶𝐵) |
| 8 | gsummptfzcl.i | . . . . . 6 ⊢ (𝜑 → 𝐼 = (𝑀...𝑁)) | |
| 9 | 8 | feq2d 6644 | . . . . 5 ⊢ (𝜑 → ((𝑖 ∈ 𝐼 ↦ 𝑋):𝐼⟶𝐵 ↔ (𝑖 ∈ 𝐼 ↦ 𝑋):(𝑀...𝑁)⟶𝐵)) |
| 10 | 7, 9 | bitrid 283 | . . . 4 ⊢ (𝜑 → (∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵 ↔ (𝑖 ∈ 𝐼 ↦ 𝑋):(𝑀...𝑁)⟶𝐵)) |
| 11 | 5, 10 | mpbid 232 | . . 3 ⊢ (𝜑 → (𝑖 ∈ 𝐼 ↦ 𝑋):(𝑀...𝑁)⟶𝐵) |
| 12 | 1, 2, 3, 4, 11 | gsumval2 18609 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ 𝐼 ↦ 𝑋)) = (seq𝑀((+g‘𝐺), (𝑖 ∈ 𝐼 ↦ 𝑋))‘𝑁)) |
| 13 | 5 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → ∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵) |
| 14 | 13, 7 | sylib 218 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝑖 ∈ 𝐼 ↦ 𝑋):𝐼⟶𝐵) |
| 15 | 8 | eqcomd 2740 | . . . . . 6 ⊢ (𝜑 → (𝑀...𝑁) = 𝐼) |
| 16 | 15 | eleq2d 2820 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑥 ∈ 𝐼)) |
| 17 | 16 | biimpa 476 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑥 ∈ 𝐼) |
| 18 | 14, 17 | ffvelcdmd 7028 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → ((𝑖 ∈ 𝐼 ↦ 𝑋)‘𝑥) ∈ 𝐵) |
| 19 | 3 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐺 ∈ Mnd) |
| 20 | simprl 770 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵) | |
| 21 | simprr 772 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 22 | 1, 2 | mndcl 18665 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 23 | 19, 20, 21, 22 | syl3anc 1373 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
| 24 | 4, 18, 23 | seqcl 13943 | . 2 ⊢ (𝜑 → (seq𝑀((+g‘𝐺), (𝑖 ∈ 𝐼 ↦ 𝑋))‘𝑁) ∈ 𝐵) |
| 25 | 12, 24 | eqeltrd 2834 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ 𝐼 ↦ 𝑋)) ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3049 ↦ cmpt 5177 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 ℤ≥cuz 12749 ...cfz 13421 seqcseq 13922 Basecbs 17134 +gcplusg 17175 Σg cgsu 17358 Mndcmnd 18657 |
| 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 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| 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 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-fz 13422 df-seq 13923 df-0g 17359 df-gsum 17360 df-mgm 18563 df-sgrp 18642 df-mnd 18658 |
| This theorem is referenced by: m2detleiblem2 22570 |
| Copyright terms: Public domain | W3C validator |