Theorem frmdup1 18791

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, 27-Sep-2015.)

Hypotheses

Ref	Expression
frmdup.m	⊢ 𝑀 = (freeMnd‘𝐼)
frmdup.b	⊢ 𝐵 = (Base‘𝐺)
frmdup.e	⊢ 𝐸 = (𝑥 ∈ Word 𝐼 ↦ (𝐺 Σg (𝐴 ∘ 𝑥)))
frmdup.g	⊢ (𝜑 → 𝐺 ∈ Mnd)
frmdup.i	⊢ (𝜑 → 𝐼 ∈ 𝑋)
frmdup.a	⊢ (𝜑 → 𝐴:𝐼⟶𝐵)

Assertion

Ref	Expression
frmdup1	⊢ (𝜑 → 𝐸 ∈ (𝑀 MndHom 𝐺))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐺   𝜑,𝑥   𝑥,𝐼

Allowed substitution hints:   𝐸(𝑥)   𝑀(𝑥)   𝑋(𝑥)

Proof of Theorem frmdup1

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frmdup.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑋)
2		frmdup.m	. . . 4 ⊢ 𝑀 = (freeMnd‘𝐼)
3	2	frmdmnd 18786	. . 3 ⊢ (𝐼 ∈ 𝑋 → 𝑀 ∈ Mnd)
4	1, 3	syl 17	. 2 ⊢ (𝜑 → 𝑀 ∈ Mnd)
5		frmdup.g	. 2 ⊢ (𝜑 → 𝐺 ∈ Mnd)
6	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → 𝐺 ∈ Mnd)
7		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → 𝑥 ∈ Word 𝐼)
8		frmdup.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴:𝐼⟶𝐵)
9	8	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → 𝐴:𝐼⟶𝐵)
10		wrdco 14797	. . . . . . 7 ⊢ ((𝑥 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ 𝑥) ∈ Word 𝐵)
11	7, 9, 10	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → (𝐴 ∘ 𝑥) ∈ Word 𝐵)
12		frmdup.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
13	12	gsumwcl 18766	. . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ (𝐴 ∘ 𝑥) ∈ Word 𝐵) → (𝐺 Σg (𝐴 ∘ 𝑥)) ∈ 𝐵)
14	6, 11, 13	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → (𝐺 Σg (𝐴 ∘ 𝑥)) ∈ 𝐵)
15		frmdup.e	. . . . 5 ⊢ 𝐸 = (𝑥 ∈ Word 𝐼 ↦ (𝐺 Σg (𝐴 ∘ 𝑥)))
16	14, 15	fmptd 7086	. . . 4 ⊢ (𝜑 → 𝐸:Word 𝐼⟶𝐵)
17		eqid 2729	. . . . . . 7 ⊢ (Base‘𝑀) = (Base‘𝑀)
18	2, 17	frmdbas 18779	. . . . . 6 ⊢ (𝐼 ∈ 𝑋 → (Base‘𝑀) = Word 𝐼)
19	1, 18	syl 17	. . . . 5 ⊢ (𝜑 → (Base‘𝑀) = Word 𝐼)
20	19	feq2d 6672	. . . 4 ⊢ (𝜑 → (𝐸:(Base‘𝑀)⟶𝐵 ↔ 𝐸:Word 𝐼⟶𝐵))
21	16, 20	mpbird 257	. . 3 ⊢ (𝜑 → 𝐸:(Base‘𝑀)⟶𝐵)
22	2, 17	frmdelbas 18780	. . . . . . . . 9 ⊢ (𝑦 ∈ (Base‘𝑀) → 𝑦 ∈ Word 𝐼)
23	22	ad2antrl 728	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝑦 ∈ Word 𝐼)
24	2, 17	frmdelbas 18780	. . . . . . . . 9 ⊢ (𝑧 ∈ (Base‘𝑀) → 𝑧 ∈ Word 𝐼)
25	24	ad2antll 729	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝑧 ∈ Word 𝐼)
26	8	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝐴:𝐼⟶𝐵)
27		ccatco 14801	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝑧 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ (𝑦 ++ 𝑧)) = ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧)))
28	23, 25, 26, 27	syl3anc 1373	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐴 ∘ (𝑦 ++ 𝑧)) = ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧)))
29	28	oveq2d 7403	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐺 Σg (𝐴 ∘ (𝑦 ++ 𝑧))) = (𝐺 Σg ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧))))
30	5	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝐺 ∈ Mnd)
31		wrdco 14797	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ 𝑦) ∈ Word 𝐵)
32	23, 26, 31	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐴 ∘ 𝑦) ∈ Word 𝐵)
33		wrdco 14797	. . . . . . . 8 ⊢ ((𝑧 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ 𝑧) ∈ Word 𝐵)
34	25, 26, 33	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐴 ∘ 𝑧) ∈ Word 𝐵)
35		eqid 2729	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
36	12, 35	gsumccat 18768	. . . . . . 7 ⊢ ((𝐺 ∈ Mnd ∧ (𝐴 ∘ 𝑦) ∈ Word 𝐵 ∧ (𝐴 ∘ 𝑧) ∈ Word 𝐵) → (𝐺 Σg ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧))) = ((𝐺 Σg (𝐴 ∘ 𝑦))(+g‘𝐺)(𝐺 Σg (𝐴 ∘ 𝑧))))
37	30, 32, 34, 36	syl3anc 1373	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐺 Σg ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧))) = ((𝐺 Σg (𝐴 ∘ 𝑦))(+g‘𝐺)(𝐺 Σg (𝐴 ∘ 𝑧))))
38	29, 37	eqtrd 2764	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐺 Σg (𝐴 ∘ (𝑦 ++ 𝑧))) = ((𝐺 Σg (𝐴 ∘ 𝑦))(+g‘𝐺)(𝐺 Σg (𝐴 ∘ 𝑧))))
39		eqid 2729	. . . . . . . . 9 ⊢ (+g‘𝑀) = (+g‘𝑀)
40	2, 17, 39	frmdadd 18782	. . . . . . . 8 ⊢ ((𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀)) → (𝑦(+g‘𝑀)𝑧) = (𝑦 ++ 𝑧))
41	40	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝑦(+g‘𝑀)𝑧) = (𝑦 ++ 𝑧))
42	41	fveq2d 6862	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦(+g‘𝑀)𝑧)) = (𝐸‘(𝑦 ++ 𝑧)))
43		ccatcl 14539	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝑧 ∈ Word 𝐼) → (𝑦 ++ 𝑧) ∈ Word 𝐼)
44	23, 25, 43	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝑦 ++ 𝑧) ∈ Word 𝐼)
45		coeq2 5822	. . . . . . . . 9 ⊢ (𝑥 = (𝑦 ++ 𝑧) → (𝐴 ∘ 𝑥) = (𝐴 ∘ (𝑦 ++ 𝑧)))
46	45	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = (𝑦 ++ 𝑧) → (𝐺 Σg (𝐴 ∘ 𝑥)) = (𝐺 Σg (𝐴 ∘ (𝑦 ++ 𝑧))))
47		ovex 7420	. . . . . . . 8 ⊢ (𝐺 Σg (𝐴 ∘ 𝑥)) ∈ V
48	46, 15, 47	fvmpt3i 6973	. . . . . . 7 ⊢ ((𝑦 ++ 𝑧) ∈ Word 𝐼 → (𝐸‘(𝑦 ++ 𝑧)) = (𝐺 Σg (𝐴 ∘ (𝑦 ++ 𝑧))))
49	44, 48	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦 ++ 𝑧)) = (𝐺 Σg (𝐴 ∘ (𝑦 ++ 𝑧))))
50	42, 49	eqtrd 2764	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦(+g‘𝑀)𝑧)) = (𝐺 Σg (𝐴 ∘ (𝑦 ++ 𝑧))))
51		coeq2 5822	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐴 ∘ 𝑥) = (𝐴 ∘ 𝑦))
52	51	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐺 Σg (𝐴 ∘ 𝑥)) = (𝐺 Σg (𝐴 ∘ 𝑦)))
53	52, 15, 47	fvmpt3i 6973	. . . . . . 7 ⊢ (𝑦 ∈ Word 𝐼 → (𝐸‘𝑦) = (𝐺 Σg (𝐴 ∘ 𝑦)))
54		coeq2 5822	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝐴 ∘ 𝑥) = (𝐴 ∘ 𝑧))
55	54	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝐺 Σg (𝐴 ∘ 𝑥)) = (𝐺 Σg (𝐴 ∘ 𝑧)))
56	55, 15, 47	fvmpt3i 6973	. . . . . . 7 ⊢ (𝑧 ∈ Word 𝐼 → (𝐸‘𝑧) = (𝐺 Σg (𝐴 ∘ 𝑧)))
57	53, 56	oveqan12d 7406	. . . . . 6 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝑧 ∈ Word 𝐼) → ((𝐸‘𝑦)(+g‘𝐺)(𝐸‘𝑧)) = ((𝐺 Σg (𝐴 ∘ 𝑦))(+g‘𝐺)(𝐺 Σg (𝐴 ∘ 𝑧))))
58	23, 25, 57	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → ((𝐸‘𝑦)(+g‘𝐺)(𝐸‘𝑧)) = ((𝐺 Σg (𝐴 ∘ 𝑦))(+g‘𝐺)(𝐺 Σg (𝐴 ∘ 𝑧))))
59	38, 50, 58	3eqtr4d 2774	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦(+g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+g‘𝐺)(𝐸‘𝑧)))
60	59	ralrimivva 3180	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)(𝐸‘(𝑦(+g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+g‘𝐺)(𝐸‘𝑧)))
61		wrd0 14504	. . . 4 ⊢ ∅ ∈ Word 𝐼
62		coeq2 5822	. . . . . . . 8 ⊢ (𝑥 = ∅ → (𝐴 ∘ 𝑥) = (𝐴 ∘ ∅))
63		co02 6233	. . . . . . . 8 ⊢ (𝐴 ∘ ∅) = ∅
64	62, 63	eqtrdi 2780	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐴 ∘ 𝑥) = ∅)
65	64	oveq2d 7403	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐺 Σg (𝐴 ∘ 𝑥)) = (𝐺 Σg ∅))
66		eqid 2729	. . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺)
67	66	gsum0 18611	. . . . . 6 ⊢ (𝐺 Σg ∅) = (0g‘𝐺)
68	65, 67	eqtrdi 2780	. . . . 5 ⊢ (𝑥 = ∅ → (𝐺 Σg (𝐴 ∘ 𝑥)) = (0g‘𝐺))
69	68, 15, 47	fvmpt3i 6973	. . . 4 ⊢ (∅ ∈ Word 𝐼 → (𝐸‘∅) = (0g‘𝐺))
70	61, 69	mp1i 13	. . 3 ⊢ (𝜑 → (𝐸‘∅) = (0g‘𝐺))
71	21, 60, 70	3jca 1128	. 2 ⊢ (𝜑 → (𝐸:(Base‘𝑀)⟶𝐵 ∧ ∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)(𝐸‘(𝑦(+g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+g‘𝐺)(𝐸‘𝑧)) ∧ (𝐸‘∅) = (0g‘𝐺)))
72	2	frmd0 18787	. . 3 ⊢ ∅ = (0g‘𝑀)
73	17, 12, 39, 35, 72, 66	ismhm 18712	. 2 ⊢ (𝐸 ∈ (𝑀 MndHom 𝐺) ↔ ((𝑀 ∈ Mnd ∧ 𝐺 ∈ Mnd) ∧ (𝐸:(Base‘𝑀)⟶𝐵 ∧ ∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)(𝐸‘(𝑦(+g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+g‘𝐺)(𝐸‘𝑧)) ∧ (𝐸‘∅) = (0g‘𝐺))))
74	4, 5, 71, 73	syl21anbrc 1345	1 ⊢ (𝜑 → 𝐸 ∈ (𝑀 MndHom 𝐺))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∅c0 4296   ↦ cmpt 5188   ∘ ccom 5642  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387  Word cword 14478   ++ cconcat 14535  Basecbs 17179  +_gcplusg 17220  0_gc0g 17402   Σ_g cgsu 17403  Mndcmnd 18661   MndHom cmhm 18708  freeMndcfrmd 18774

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-er 8671  df-map 8801  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-n0 12443  df-z 12530  df-uz 12794  df-fz 13469  df-fzo 13616  df-seq 13967  df-hash 14296  df-word 14479  df-concat 14536  df-struct 17117  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-gsum 17405  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-mhm 18710  df-submnd 18711  df-frmd 18776

This theorem is referenced by:  frmdup3  18794