| 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 18893 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ Mnd) |
| 4 | frgpup.w | . . . . . . . 8 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 5 | fviss 6921 | . . . . . . . 8 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o) | |
| 6 | 4, 5 | eqsstri 3982 | . . . . . . 7 ⊢ 𝑊 ⊆ Word (𝐼 × 2o) |
| 7 | 6 | sseli 3931 | . . . . . 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 19716 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| 14 | wrdco 14768 | . . . . . 6 ⊢ ((𝑔 ∈ Word (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 𝑔) ∈ Word 𝐵) | |
| 15 | 7, 13, 14 | syl2anr 598 | . . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝑇 ∘ 𝑔) ∈ Word 𝐵) |
| 16 | 8 | gsumwcl 18778 | . . . . 5 ⊢ ((𝐻 ∈ Mnd ∧ (𝑇 ∘ 𝑔) ∈ Word 𝐵) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ 𝐵) |
| 17 | 3, 15, 16 | syl2an2r 686 | . . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ 𝐵) |
| 18 | frgpup.r | . . . . . 6 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 19 | 4, 18 | efger 19664 | . . . . 5 ⊢ ∼ Er 𝑊 |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (𝜑 → ∼ Er 𝑊) |
| 21 | 4 | fvexi 6858 | . . . . 5 ⊢ 𝑊 ∈ V |
| 22 | 21 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑊 ∈ V) |
| 23 | coeq2 5817 | . . . . 5 ⊢ (𝑔 = ℎ → (𝑇 ∘ 𝑔) = (𝑇 ∘ ℎ)) | |
| 24 | 23 | oveq2d 7386 | . . . 4 ⊢ (𝑔 = ℎ → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ ℎ))) |
| 25 | 8, 9, 10, 2, 11, 12, 4, 18 | frgpuplem 19718 | . . . 4 ⊢ ((𝜑 ∧ 𝑔 ∼ ℎ) → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ ℎ))) |
| 26 | 1, 17, 20, 22, 24, 25 | qliftfund 8754 | . . 3 ⊢ (𝜑 → Fun 𝐸) |
| 27 | 1, 17, 20, 22 | qliftf 8756 | . . 3 ⊢ (𝜑 → (Fun 𝐸 ↔ 𝐸:(𝑊 / ∼ )⟶𝐵)) |
| 28 | 26, 27 | mpbid 232 | . 2 ⊢ (𝜑 → 𝐸:(𝑊 / ∼ )⟶𝐵) |
| 29 | frgpup.x | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 30 | frgpup.g | . . . . . . 7 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 31 | eqid 2737 | . . . . . . 7 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o)) | |
| 32 | 30, 31, 18 | frgpval 19704 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 33 | 11, 32 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 34 | 2on 8422 | . . . . . . . . 9 ⊢ 2o ∈ On | |
| 35 | xpexg 7707 | . . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 36 | 11, 34, 35 | sylancl 587 | . . . . . . . 8 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
| 37 | wrdexg 14461 | . . . . . . . 8 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
| 38 | fvi 6920 | . . . . . . . 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 2784 | . . . . . 6 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
| 41 | eqid 2737 | . . . . . . . 8 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o))) | |
| 42 | 31, 41 | frmdbas 18791 | . . . . . . 7 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 43 | 36, 42 | syl 17 | . . . . . 6 ⊢ (𝜑 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 44 | 40, 43 | eqtr4d 2775 | . . . . 5 ⊢ (𝜑 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2o)))) |
| 45 | 18 | fvexi 6858 | . . . . . 6 ⊢ ∼ ∈ V |
| 46 | 45 | a1i 11 | . . . . 5 ⊢ (𝜑 → ∼ ∈ V) |
| 47 | fvexd 6859 | . . . . 5 ⊢ (𝜑 → (freeMnd‘(𝐼 × 2o)) ∈ V) | |
| 48 | 33, 44, 46, 47 | qusbas 17480 | . . . 4 ⊢ (𝜑 → (𝑊 / ∼ ) = (Base‘𝐺)) |
| 49 | 29, 48 | eqtr4id 2791 | . . 3 ⊢ (𝜑 → 𝑋 = (𝑊 / ∼ )) |
| 50 | 49 | feq2d 6656 | . 2 ⊢ (𝜑 → (𝐸:𝑋⟶𝐵 ↔ 𝐸:(𝑊 / ∼ )⟶𝐵)) |
| 51 | 28, 50 | mpbird 257 | 1 ⊢ (𝜑 → 𝐸:𝑋⟶𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∅c0 4287 ifcif 4481 〈cop 4588 ↦ cmpt 5181 I cid 5528 × cxp 5632 ran crn 5635 ∘ ccom 5638 Oncon0 6327 Fun wfun 6496 ⟶wf 6498 ‘cfv 6502 (class class class)co 7370 ∈ cmpo 7372 2oc2o 8403 Er wer 8644 [cec 8645 / cqs 8646 Word cword 14450 Basecbs 17150 Σg cgsu 17374 /s cqus 17440 Mndcmnd 18673 freeMndcfrmd 18786 Grpcgrp 18880 invgcminusg 18881 ~FG cefg 19652 freeGrpcfrgp 19653 |
| 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 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-ot 4591 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-ec 8649 df-qs 8653 df-map 8779 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-sup 9359 df-inf 9360 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-z 12503 df-dec 12622 df-uz 12766 df-fz 13438 df-fzo 13585 df-seq 13939 df-hash 14268 df-word 14451 df-concat 14508 df-s1 14534 df-substr 14579 df-pfx 14609 df-splice 14687 df-s2 14785 df-struct 17088 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-mulr 17205 df-sca 17207 df-vsca 17208 df-ip 17209 df-tset 17210 df-ple 17211 df-ds 17213 df-0g 17375 df-gsum 17376 df-imas 17443 df-qus 17444 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-submnd 18723 df-frmd 18788 df-grp 18883 df-minusg 18884 df-efg 19655 df-frgp 19656 |
| This theorem is referenced by: frgpupval 19720 frgpup1 19721 |
| Copyright terms: Public domain | W3C validator |