| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgpupval | Structured version Visualization version GIF version | ||
| Description: Any assignment of the generators to target elements can be extended (uniquely) to a homomorphism from a free monoid to an arbitrary other monoid. (Contributed by Mario Carneiro, 2-Oct-2015.) |
| Ref | Expression |
|---|---|
| frgpup.b | ⊢ 𝐵 = (Base‘𝐻) |
| frgpup.n | ⊢ 𝑁 = (invg‘𝐻) |
| frgpup.t | ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) |
| frgpup.h | ⊢ (𝜑 → 𝐻 ∈ Grp) |
| frgpup.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
| frgpup.a | ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
| frgpup.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) |
| frgpup.r | ⊢ ∼ = ( ~FG ‘𝐼) |
| frgpup.g | ⊢ 𝐺 = (freeGrp‘𝐼) |
| frgpup.x | ⊢ 𝑋 = (Base‘𝐺) |
| frgpup.e | ⊢ 𝐸 = ran (𝑔 ∈ 𝑊 ↦ 〈[𝑔] ∼ , (𝐻 Σg (𝑇 ∘ 𝑔))〉) |
| Ref | Expression |
|---|---|
| frgpupval | ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑊) → (𝐸‘[𝐴] ∼ ) = (𝐻 Σg (𝑇 ∘ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgpup.e | . 2 ⊢ 𝐸 = ran (𝑔 ∈ 𝑊 ↦ 〈[𝑔] ∼ , (𝐻 Σg (𝑇 ∘ 𝑔))〉) | |
| 2 | ovexd 7397 | . 2 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ V) | |
| 3 | frgpup.w | . . . 4 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 4 | frgpup.r | . . . 4 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 5 | 3, 4 | efger 19688 | . . 3 ⊢ ∼ Er 𝑊 |
| 6 | 5 | a1i 11 | . 2 ⊢ (𝜑 → ∼ Er 𝑊) |
| 7 | 3 | fvexi 6850 | . . 3 ⊢ 𝑊 ∈ V |
| 8 | 7 | a1i 11 | . 2 ⊢ (𝜑 → 𝑊 ∈ V) |
| 9 | coeq2 5809 | . . 3 ⊢ (𝑔 = 𝐴 → (𝑇 ∘ 𝑔) = (𝑇 ∘ 𝐴)) | |
| 10 | 9 | oveq2d 7378 | . 2 ⊢ (𝑔 = 𝐴 → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ 𝐴))) |
| 11 | frgpup.b | . . . 4 ⊢ 𝐵 = (Base‘𝐻) | |
| 12 | frgpup.n | . . . 4 ⊢ 𝑁 = (invg‘𝐻) | |
| 13 | frgpup.t | . . . 4 ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) | |
| 14 | frgpup.h | . . . 4 ⊢ (𝜑 → 𝐻 ∈ Grp) | |
| 15 | frgpup.i | . . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 16 | frgpup.a | . . . 4 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) | |
| 17 | frgpup.g | . . . 4 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 18 | frgpup.x | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 19 | 11, 12, 13, 14, 15, 16, 3, 4, 17, 18, 1 | frgpupf 19743 | . . 3 ⊢ (𝜑 → 𝐸:𝑋⟶𝐵) |
| 20 | 19 | ffund 6668 | . 2 ⊢ (𝜑 → Fun 𝐸) |
| 21 | 1, 2, 6, 8, 10, 20 | qliftval 8748 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑊) → (𝐸‘[𝐴] ∼ ) = (𝐻 Σg (𝑇 ∘ 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∅c0 4274 ifcif 4467 〈cop 4574 ↦ cmpt 5167 I cid 5520 × cxp 5624 ran crn 5627 ∘ ccom 5630 ⟶wf 6490 ‘cfv 6494 (class class class)co 7362 ∈ cmpo 7364 2oc2o 8394 Er wer 8635 [cec 8636 Word cword 14470 Basecbs 17174 Σg cgsu 17398 Grpcgrp 18904 invgcminusg 18905 ~FG cefg 19676 freeGrpcfrgp 19677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-ot 4577 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7813 df-1st 7937 df-2nd 7938 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-2o 8401 df-er 8638 df-ec 8640 df-qs 8644 df-map 8770 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-sup 9350 df-inf 9351 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-dec 12640 df-uz 12784 df-fz 13457 df-fzo 13604 df-seq 13959 df-hash 14288 df-word 14471 df-concat 14528 df-s1 14554 df-substr 14599 df-pfx 14629 df-splice 14707 df-s2 14805 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-mulr 17229 df-sca 17231 df-vsca 17232 df-ip 17233 df-tset 17234 df-ple 17235 df-ds 17237 df-0g 17399 df-gsum 17400 df-imas 17467 df-qus 17468 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-submnd 18747 df-frmd 18812 df-grp 18907 df-minusg 18908 df-efg 19679 df-frgp 19680 |
| This theorem is referenced by: frgpup1 19745 frgpup2 19746 frgpup3lem 19747 |
| Copyright terms: Public domain | W3C validator |