| 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 19209 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ Mnd) |
| 4 | frgpup.w | . . . . . . . 8 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
| 5 | fviss 6992 | . . . . . . . 8 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o) | |
| 6 | 4, 5 | eqsstri 3958 | . . . . . . 7 ⊢ 𝑊 ⊆ Word (𝐼 × 2o) |
| 7 | 6 | sseli 3908 | . . . . . 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 20037 | . . . . . 6 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| 14 | wrdco 15023 | . . . . . 6 ⊢ ((𝑔 ∈ Word (𝐼 × 2o) ∧ 𝑇:(𝐼 × 2o)⟶𝐵) → (𝑇 ∘ 𝑔) ∈ Word 𝐵) | |
| 15 | 7, 13, 14 | syl2anr 609 | . . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝑇 ∘ 𝑔) ∈ Word 𝐵) |
| 16 | 8 | gsumwcl 19087 | . . . . 5 ⊢ ((𝐻 ∈ Mnd ∧ (𝑇 ∘ 𝑔) ∈ Word 𝐵) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ 𝐵) |
| 17 | 3, 15, 16 | syl2an2r 698 | . . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝑊) → (𝐻 Σg (𝑇 ∘ 𝑔)) ∈ 𝐵) |
| 18 | frgpup.r | . . . . . 6 ⊢ ∼ = ( ~FG ‘𝐼) | |
| 19 | 4, 18 | efger 19985 | . . . . 5 ⊢ ∼ Er 𝑊 |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (𝜑 → ∼ Er 𝑊) |
| 21 | 4 | fvexi 6929 | . . . . 5 ⊢ 𝑊 ∈ V |
| 22 | 21 | a1i 11 | . . . 4 ⊢ (𝜑 → 𝑊 ∈ V) |
| 23 | coeq2 5846 | . . . . 5 ⊢ (𝑔 = ℎ → (𝑇 ∘ 𝑔) = (𝑇 ∘ ℎ)) | |
| 24 | 23 | oveq2d 7466 | . . . 4 ⊢ (𝑔 = ℎ → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ ℎ))) |
| 25 | 8, 9, 10, 2, 11, 12, 4, 18 | frgpuplem 20039 | . . . 4 ⊢ ((𝜑 ∧ 𝑔 ∼ ℎ) → (𝐻 Σg (𝑇 ∘ 𝑔)) = (𝐻 Σg (𝑇 ∘ ℎ))) |
| 26 | 1, 17, 20, 22, 24, 25 | qliftfund 8861 | . . 3 ⊢ (𝜑 → Fun 𝐸) |
| 27 | 1, 17, 20, 22 | qliftf 8863 | . . 3 ⊢ (𝜑 → (Fun 𝐸 ↔ 𝐸:(𝑊 / ∼ )⟶𝐵)) |
| 28 | 26, 27 | mpbid 235 | . 2 ⊢ (𝜑 → 𝐸:(𝑊 / ∼ )⟶𝐵) |
| 29 | frgpup.x | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 30 | frgpup.g | . . . . . . 7 ⊢ 𝐺 = (freeGrp‘𝐼) | |
| 31 | eqid 2766 | . . . . . . 7 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o)) | |
| 32 | 30, 31, 18 | frgpval 20025 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 33 | 11, 32 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ )) |
| 34 | 2on 8527 | . . . . . . . . 9 ⊢ 2o ∈ On | |
| 35 | xpexg 7795 | . . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V) | |
| 36 | 11, 34, 35 | sylancl 598 | . . . . . . . 8 ⊢ (𝜑 → (𝐼 × 2o) ∈ V) |
| 37 | wrdexg 14709 | . . . . . . . 8 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V) | |
| 38 | fvi 6991 | . . . . . . . 8 ⊢ (Word (𝐼 × 2o) ∈ V → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) | |
| 39 | 36, 37, 38 | 3syl 19 | . . . . . . 7 ⊢ (𝜑 → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o)) |
| 40 | 4, 39 | eqtrid 2813 | . . . . . 6 ⊢ (𝜑 → 𝑊 = Word (𝐼 × 2o)) |
| 41 | eqid 2766 | . . . . . . . 8 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o))) | |
| 42 | 31, 41 | frmdbas 19100 | . . . . . . 7 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 43 | 36, 42 | syl 18 | . . . . . 6 ⊢ (𝜑 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o)) |
| 44 | 40, 43 | eqtr4d 2804 | . . . . 5 ⊢ (𝜑 → 𝑊 = (Base‘(freeMnd‘(𝐼 × 2o)))) |
| 45 | 18 | fvexi 6929 | . . . . . 6 ⊢ ∼ ∈ V |
| 46 | 45 | a1i 11 | . . . . 5 ⊢ (𝜑 → ∼ ∈ V) |
| 47 | fvexd 6930 | . . . . 5 ⊢ (𝜑 → (freeMnd‘(𝐼 × 2o)) ∈ V) | |
| 48 | 33, 44, 46, 47 | qusbas 17769 | . . . 4 ⊢ (𝜑 → (𝑊 / ∼ ) = (Base‘𝐺)) |
| 49 | 29, 48 | eqtr4id 2820 | . . 3 ⊢ (𝜑 → 𝑋 = (𝑊 / ∼ )) |
| 50 | 49 | feq2d 6722 | . 2 ⊢ (𝜑 → (𝐸:𝑋⟶𝐵 ↔ 𝐸:(𝑊 / ∼ )⟶𝐵)) |
| 51 | 28, 50 | mpbird 260 | 1 ⊢ (𝜑 → 𝐸:𝑋⟶𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 Vcvv 3453 ∅c0 4280 ifcif 4484 〈cop 4839 ↦ cmpt 5191 I cid 5551 × cxp 5655 ran crn 5658 ∘ ccom 5661 Oncon0 6387 Fun wfun 6559 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 ∈ cmpo 7452 2oc2o 8507 Er wer 8751 [cec 8752 / cqs 8753 Word cword 14698 Basecbs 17433 Σg cgsu 17663 /s cqus 17729 Mndcmnd 18975 freeMndcfrmd 19095 Grpcgrp 19196 invgcminusg 19197 ~FG cefg 19973 freeGrpcfrgp 19974 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-ot 4863 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-er 8754 df-ec 8756 df-qs 8760 df-map 8886 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-sup 9470 df-inf 9471 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-4 12446 df-5 12447 df-6 12448 df-7 12449 df-8 12450 df-9 12451 df-n0 12646 df-z 12733 df-dec 12854 df-uz 13005 df-fz 13679 df-fzo 13828 df-seq 14184 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-substr 14830 df-pfx 14862 df-splice 14940 df-s2 15040 df-struct 17371 df-sets 17388 df-slot 17406 df-ndx 17418 df-base 17434 df-ress 17455 df-plusg 17488 df-mulr 17489 df-sca 17491 df-vsca 17492 df-ip 17493 df-tset 17494 df-ple 17495 df-ds 17497 df-0g 17664 df-gsum 17665 df-imas 17732 df-qus 17733 df-mgm 18868 df-sgrp 18960 df-mnd 18976 df-submnd 19031 df-frmd 19097 df-grp 19199 df-minusg 19200 df-efg 19976 df-frgp 19977 |
| This theorem is used by: frgpupval 20041 frgpup1 20042 |
| Copyright terms: Public domain | W3C validator |