| 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 7446 | . 2 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ V) | |
| 3 | frgpup.w | . . . 4 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 4 | frgpup.r | . . . 4 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 5 | 3, 4 | efger 19788 | . . 3 ⊢ ∼ Er 𝑊 |
| 6 | 5 | a1i 11 | . 2 ⊢ (𝜑 → ∼ Er 𝑊) |
| 7 | 3 | fvexi 6896 | . . 3 ⊢ 𝑊 ∈ V |
| 8 | 7 | a1i 11 | . 2 ⊢ (𝜑 → 𝑊 ∈ V) |
| 9 | coeq2 5845 | . . 3 ⊢ (𝑔 = 𝐴 → (𝑇 ∘ 𝑔) = (𝑇 ∘ 𝐴)) | |
| 10 | 9 | oveq2d 7427 | . 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 19843 | . . 3 ⊢ (𝜑 → 𝐸:𝑋⟶𝐵) |
| 20 | 19 | ffund 6711 | . 2 ⊢ (𝜑 → Fun 𝐸) |
| 21 | 1, 2, 6, 8, 10, 20 | qliftval 8804 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑊) → (𝐸‘[𝐴] ∼ ) = (𝐻 Σg (𝑇 ∘ 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3461 ∅c0 4292 ifcif 4490 〈cop 4598 ↦ cmpt 5194 I cid 5556 × cxp 5660 ran crn 5663 ∘ ccom 5666 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 2oc2o 8447 Er wer 8691 [cec 8692 Word cword 14550 Basecbs 17269 Σg cgsu 17493 Grpcgrp 19000 invgcminusg 19001 ~FG cefg 19776 freeGrpcfrgp 19777 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-tp 4597 df-op 4599 df-ot 4601 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-ec 8696 df-qs 8700 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-sup 9402 df-inf 9403 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-fz 13536 df-fzo 13683 df-seq 14038 df-hash 14367 df-word 14551 df-concat 14608 df-s1 14634 df-substr 14679 df-pfx 14709 df-splice 14787 df-s2 14885 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-0g 17494 df-gsum 17495 df-imas 17562 df-qus 17563 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-frmd 18908 df-grp 19003 df-minusg 19004 df-efg 19779 df-frgp 19780 |
| This theorem is referenced by: frgpup1 19845 frgpup2 19846 frgpup3lem 19847 |
| Copyright terms: Public domain | W3C validator |