| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgpupf | 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 |
|---|---|
| frgpupf | ⊢ (𝜑 → 𝐸:𝑋⟶𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgpup.e | . . . 4 ⊢ 𝐸 = ran (𝑔 ∈ 𝑊 ↦ 〈[𝑔] ∼ , (𝐻 Σg (𝑇 ∘ 𝑔))〉) | |
| 2 | frgpup.h | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ Grp) | |
| 3 | 2 | grpmndd 18859 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ Mnd) |
| 4 | frgpup.w | . . . . . . . 8 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 5 | fviss 6899 | . . . . . . . 8 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o) | |
| 6 | 4, 5 | eqsstri 3976 | . . . . . . 7 ⊢ 𝑊 ⊆ Word (𝐼 × 2o) |
| 7 | 6 | sseli 3925 | . . . . . 6 ⊢ (𝑔 ∈ 𝑊 → 𝑔 ∈ Word (𝐼 × 2o)) |
| 8 | frgpup.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐻) | |
| 9 | frgpup.n | . . . . . . 7 ⊢ 𝑁 = (invg‘𝐻) | |
| 10 | frgpup.t | . . . . . . 7 ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) | |
| 11 | frgpup.i | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 12 | frgpup.a | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) | |
| 13 | 8, 9, 10, 2, 11, 12 | frgpuptf 19682 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| 14 | wrdco 14738 | . . . . . 6 ⊢ ((𝑔 ∈ Word (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 𝑔) ∈ Word 𝐵) | |
| 15 | 7, 13, 14 | syl2anr 597 | . . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝑇 ∘ 𝑔) ∈ Word 𝐵) |
| 16 | 8 | gsumwcl 18747 | . . . . 5 ⊢ ((𝐻 ∈ Mnd ∧ (𝑇 ∘ 𝑔) ∈ Word 𝐵) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ 𝐵) |
| 17 | 3, 15, 16 | syl2an2r 685 | . . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ 𝐵) |
| 18 | frgpup.r | . . . . . 6 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 19 | 4, 18 | efger 19630 | . . . . 5 ⊢ ∼ Er 𝑊 |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (𝜑 → ∼ Er 𝑊) |
| 21 | 4 | fvexi 6836 | . . . . 5 ⊢ 𝑊 ∈ V |
| 22 | 21 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑊 ∈ V) |
| 23 | coeq2 5797 | . . . . 5 ⊢ (𝑔 = ℎ → (𝑇 ∘ 𝑔) = (𝑇 ∘ ℎ)) | |
| 24 | 23 | oveq2d 7362 | . . . 4 ⊢ (𝑔 = ℎ → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ ℎ))) |
| 25 | 8, 9, 10, 2, 11, 12, 4, 18 | frgpuplem 19684 | . . . 4 ⊢ ((𝜑 ∧ 𝑔 ∼ ℎ) → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ ℎ))) |
| 26 | 1, 17, 20, 22, 24, 25 | qliftfund 8727 | . . 3 ⊢ (𝜑 → Fun 𝐸) |
| 27 | 1, 17, 20, 22 | qliftf 8729 | . . 3 ⊢ (𝜑 → (Fun 𝐸 ↔ 𝐸:(𝑊 / ∼ )⟶𝐵)) |
| 28 | 26, 27 | mpbid 232 | . 2 ⊢ (𝜑 → 𝐸:(𝑊 / ∼ )⟶𝐵) |
| 29 | frgpup.x | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 30 | frgpup.g | . . . . . . 7 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 31 | eqid 2731 | . . . . . . 7 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o)) | |
| 32 | 30, 31, 18 | frgpval 19670 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 33 | 11, 32 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 34 | 2on 8398 | . . . . . . . . 9 ⊢ 2o ∈ On | |
| 35 | xpexg 7683 | . . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 36 | 11, 34, 35 | sylancl 586 | . . . . . . . 8 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
| 37 | wrdexg 14431 | . . . . . . . 8 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
| 38 | fvi 6898 | . . . . . . . 8 ⊢ (Word (𝐼 × 2o) ∈ V → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) | |
| 39 | 36, 37, 38 | 3syl 18 | . . . . . . 7 ⊢ (𝜑 → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) |
| 40 | 4, 39 | eqtrid 2778 | . . . . . 6 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
| 41 | eqid 2731 | . . . . . . . 8 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o))) | |
| 42 | 31, 41 | frmdbas 18760 | . . . . . . 7 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 43 | 36, 42 | syl 17 | . . . . . 6 ⊢ (𝜑 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 44 | 40, 43 | eqtr4d 2769 | . . . . 5 ⊢ (𝜑 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2o)))) |
| 45 | 18 | fvexi 6836 | . . . . . 6 ⊢ ∼ ∈ V |
| 46 | 45 | a1i 11 | . . . . 5 ⊢ (𝜑 → ∼ ∈ V) |
| 47 | fvexd 6837 | . . . . 5 ⊢ (𝜑 → (freeMnd‘(𝐼 × 2o)) ∈ V) | |
| 48 | 33, 44, 46, 47 | qusbas 17449 | . . . 4 ⊢ (𝜑 → (𝑊 / ∼ ) = (Base‘𝐺)) |
| 49 | 29, 48 | eqtr4id 2785 | . . 3 ⊢ (𝜑 → 𝑋 = (𝑊 / ∼ )) |
| 50 | 49 | feq2d 6635 | . 2 ⊢ (𝜑 → (𝐸:𝑋⟶𝐵 ↔ 𝐸:(𝑊 / ∼ )⟶𝐵)) |
| 51 | 28, 50 | mpbird 257 | 1 ⊢ (𝜑 → 𝐸:𝑋⟶𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 Vcvv 3436 ∅c0 4280 ifcif 4472 〈cop 4579 ↦ cmpt 5170 I cid 5508 × cxp 5612 ran crn 5615 ∘ ccom 5618 Oncon0 6306 Fun wfun 6475 ⟶wf 6477 ‘cfv 6481 (class class class)co 7346 ∈ cmpo 7348 2oc2o 8379 Er wer 8619 [cec 8620 / cqs 8621 Word cword 14420 Basecbs 17120 Σg cgsu 17344 /s cqus 17409 Mndcmnd 18642 freeMndcfrmd 18755 Grpcgrp 18846 invgcminusg 18847 ~FG cefg 19618 freeGrpcfrgp 19619 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-tp 4578 df-op 4580 df-ot 4582 df-uni 4857 df-int 4896 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-ec 8624 df-qs 8628 df-map 8752 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-sup 9326 df-inf 9327 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-2 12188 df-3 12189 df-4 12190 df-5 12191 df-6 12192 df-7 12193 df-8 12194 df-9 12195 df-n0 12382 df-z 12469 df-dec 12589 df-uz 12733 df-fz 13408 df-fzo 13555 df-seq 13909 df-hash 14238 df-word 14421 df-concat 14478 df-s1 14504 df-substr 14549 df-pfx 14579 df-splice 14657 df-s2 14755 df-struct 17058 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-mulr 17175 df-sca 17177 df-vsca 17178 df-ip 17179 df-tset 17180 df-ple 17181 df-ds 17183 df-0g 17345 df-gsum 17346 df-imas 17412 df-qus 17413 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-submnd 18692 df-frmd 18757 df-grp 18849 df-minusg 18850 df-efg 19621 df-frgp 19622 |
| This theorem is referenced by: frgpupval 19686 frgpup1 19687 |
| Copyright terms: Public domain | W3C validator |