![]() |
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 2740 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | gsummptfzcl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
4 | gsummptfzcl.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
5 | gsummptfzcl.e | . . . 4 ⊢ (𝜑 → ∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵) | |
6 | eqid 2740 | . . . . . 6 ⊢ (𝑖 ∈ 𝐼 ↦ 𝑋) = (𝑖 ∈ 𝐼 ↦ 𝑋) | |
7 | 6 | fmpt 7144 | . . . . 5 ⊢ (∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵 ↔ (𝑖 ∈ 𝐼 ↦ 𝑋):𝐼⟶𝐵) |
8 | gsummptfzcl.i | . . . . . 6 ⊢ (𝜑 → 𝐼 = (𝑀...𝑁)) | |
9 | 8 | feq2d 6733 | . . . . 5 ⊢ (𝜑 → ((𝑖 ∈ 𝐼 ↦ 𝑋):𝐼⟶𝐵 ↔ (𝑖 ∈ 𝐼 ↦ 𝑋):(𝑀...𝑁)⟶𝐵)) |
10 | 7, 9 | bitrid 283 | . . . 4 ⊢ (𝜑 → (∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵 ↔ (𝑖 ∈ 𝐼 ↦ 𝑋):(𝑀...𝑁)⟶𝐵)) |
11 | 5, 10 | mpbid 232 | . . 3 ⊢ (𝜑 → (𝑖 ∈ 𝐼 ↦ 𝑋):(𝑀...𝑁)⟶𝐵) |
12 | 1, 2, 3, 4, 11 | gsumval2 18724 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ 𝐼 ↦ 𝑋)) = (seq𝑀((+g‘𝐺), (𝑖 ∈ 𝐼 ↦ 𝑋))‘𝑁)) |
13 | 5 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → ∀𝑖 ∈ 𝐼 𝑋 ∈ 𝐵) |
14 | 13, 7 | sylib 218 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝑖 ∈ 𝐼 ↦ 𝑋):𝐼⟶𝐵) |
15 | 8 | eqcomd 2746 | . . . . . 6 ⊢ (𝜑 → (𝑀...𝑁) = 𝐼) |
16 | 15 | eleq2d 2830 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑥 ∈ 𝐼)) |
17 | 16 | biimpa 476 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑥 ∈ 𝐼) |
18 | 14, 17 | ffvelcdmd 7119 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀...𝑁)) → ((𝑖 ∈ 𝐼 ↦ 𝑋)‘𝑥) ∈ 𝐵) |
19 | 3 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐺 ∈ Mnd) |
20 | simprl 770 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵) | |
21 | simprr 772 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
22 | 1, 2 | mndcl 18780 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
23 | 19, 20, 21, 22 | syl3anc 1371 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
24 | 4, 18, 23 | seqcl 14073 | . 2 ⊢ (𝜑 → (seq𝑀((+g‘𝐺), (𝑖 ∈ 𝐼 ↦ 𝑋))‘𝑁) ∈ 𝐵) |
25 | 12, 24 | eqeltrd 2844 | 1 ⊢ (𝜑 → (𝐺 Σg (𝑖 ∈ 𝐼 ↦ 𝑋)) ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ↦ cmpt 5249 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 ℤ≥cuz 12903 ...cfz 13567 seqcseq 14052 Basecbs 17258 +gcplusg 17311 Σg cgsu 17500 Mndcmnd 18772 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568 df-seq 14053 df-0g 17501 df-gsum 17502 df-mgm 18678 df-sgrp 18757 df-mnd 18773 |
This theorem is referenced by: m2detleiblem2 22655 |
Copyright terms: Public domain | W3C validator |