![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gsumwsubmcl | Structured version Visualization version GIF version |
Description: Closure of the composite in any submonoid. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 1-Oct-2015.) |
Ref | Expression |
---|---|
gsumwsubmcl | ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) → (𝐺 Σg 𝑊) ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 7420 | . . . 4 ⊢ (𝑊 = ∅ → (𝐺 Σg 𝑊) = (𝐺 Σg ∅)) | |
2 | eqid 2731 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
3 | 2 | gsum0 18615 | . . . 4 ⊢ (𝐺 Σg ∅) = (0g‘𝐺) |
4 | 1, 3 | eqtrdi 2787 | . . 3 ⊢ (𝑊 = ∅ → (𝐺 Σg 𝑊) = (0g‘𝐺)) |
5 | 4 | eleq1d 2817 | . 2 ⊢ (𝑊 = ∅ → ((𝐺 Σg 𝑊) ∈ 𝑆 ↔ (0g‘𝐺) ∈ 𝑆)) |
6 | eqid 2731 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
7 | eqid 2731 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
8 | submrcl 18725 | . . . . 5 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd) | |
9 | 8 | ad2antrr 723 | . . . 4 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → 𝐺 ∈ Mnd) |
10 | lennncl 14491 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ) | |
11 | 10 | adantll 711 | . . . . . 6 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ) |
12 | nnm1nn0 12520 | . . . . . 6 ⊢ ((♯‘𝑊) ∈ ℕ → ((♯‘𝑊) − 1) ∈ ℕ0) | |
13 | 11, 12 | syl 17 | . . . . 5 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → ((♯‘𝑊) − 1) ∈ ℕ0) |
14 | nn0uz 12871 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
15 | 13, 14 | eleqtrdi 2842 | . . . 4 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → ((♯‘𝑊) − 1) ∈ (ℤ≥‘0)) |
16 | wrdf 14476 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑆 → 𝑊:(0..^(♯‘𝑊))⟶𝑆) | |
17 | 16 | ad2antlr 724 | . . . . . 6 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → 𝑊:(0..^(♯‘𝑊))⟶𝑆) |
18 | 11 | nnzd 12592 | . . . . . . . 8 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℤ) |
19 | fzoval 13640 | . . . . . . . 8 ⊢ ((♯‘𝑊) ∈ ℤ → (0..^(♯‘𝑊)) = (0...((♯‘𝑊) − 1))) | |
20 | 18, 19 | syl 17 | . . . . . . 7 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (0..^(♯‘𝑊)) = (0...((♯‘𝑊) − 1))) |
21 | 20 | feq2d 6703 | . . . . . 6 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (𝑊:(0..^(♯‘𝑊))⟶𝑆 ↔ 𝑊:(0...((♯‘𝑊) − 1))⟶𝑆)) |
22 | 17, 21 | mpbid 231 | . . . . 5 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → 𝑊:(0...((♯‘𝑊) − 1))⟶𝑆) |
23 | 6 | submss 18732 | . . . . . 6 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
24 | 23 | ad2antrr 723 | . . . . 5 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → 𝑆 ⊆ (Base‘𝐺)) |
25 | 22, 24 | fssd 6735 | . . . 4 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → 𝑊:(0...((♯‘𝑊) − 1))⟶(Base‘𝐺)) |
26 | 6, 7, 9, 15, 25 | gsumval2 18617 | . . 3 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (𝐺 Σg 𝑊) = (seq0((+g‘𝐺), 𝑊)‘((♯‘𝑊) − 1))) |
27 | 22 | ffvelcdmda 7086 | . . . 4 ⊢ ((((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) ∧ 𝑥 ∈ (0...((♯‘𝑊) − 1))) → (𝑊‘𝑥) ∈ 𝑆) |
28 | 7 | submcl 18735 | . . . . . 6 ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑆) |
29 | 28 | 3expb 1119 | . . . . 5 ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑆) |
30 | 29 | ad4ant14 749 | . . . 4 ⊢ ((((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑆) |
31 | 15, 27, 30 | seqcl 13995 | . . 3 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (seq0((+g‘𝐺), 𝑊)‘((♯‘𝑊) − 1)) ∈ 𝑆) |
32 | 26, 31 | eqeltrd 2832 | . 2 ⊢ (((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) ∧ 𝑊 ≠ ∅) → (𝐺 Σg 𝑊) ∈ 𝑆) |
33 | 2 | subm0cl 18734 | . . 3 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑆) |
34 | 33 | adantr 480 | . 2 ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) → (0g‘𝐺) ∈ 𝑆) |
35 | 5, 32, 34 | pm2.61ne 3026 | 1 ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑊 ∈ Word 𝑆) → (𝐺 Σg 𝑊) ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ≠ wne 2939 ⊆ wss 3948 ∅c0 4322 ⟶wf 6539 ‘cfv 6543 (class class class)co 7412 0cc0 11116 1c1 11117 − cmin 11451 ℕcn 12219 ℕ0cn0 12479 ℤcz 12565 ℤ≥cuz 12829 ...cfz 13491 ..^cfzo 13634 seqcseq 13973 ♯chash 14297 Word cword 14471 Basecbs 17151 +gcplusg 17204 0gc0g 17392 Σg cgsu 17393 Mndcmnd 18665 SubMndcsubmnd 18710 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-er 8709 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-card 9940 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-nn 12220 df-2 12282 df-n0 12480 df-z 12566 df-uz 12830 df-fz 13492 df-fzo 13635 df-seq 13974 df-hash 14298 df-word 14472 df-sets 17104 df-slot 17122 df-ndx 17134 df-base 17152 df-ress 17181 df-plusg 17217 df-0g 17394 df-gsum 17395 df-mgm 18571 df-sgrp 18650 df-mnd 18666 df-submnd 18712 |
This theorem is referenced by: gsumwcl 18762 gsumwspan 18769 frmdss2 18786 psgnunilem5 19410 cyc3genpm 32749 |
Copyright terms: Public domain | W3C validator |