frmdup1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > frmdup1		Structured version Visualization version GIF version

Theorem frmdup1 18741

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 18736	. . 3 ⊢ (𝐼 ∈ 𝑋 → 𝑀 ∈ Mnd)
4	1, 3	syl 17	. 2 ⊢ (𝜑 → 𝑀 ∈ Mnd)
5		frmdup.g	. 2 ⊢ (𝜑 → 𝐺 ∈ Mnd)
6	5	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → 𝐺 ∈ Mnd)
7		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → 𝑥 ∈ Word 𝐼)
8		frmdup.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴:𝐼⟶𝐵)
9	8	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → 𝐴:𝐼⟶𝐵)
10		wrdco 14778	. . . . . . 7 ⊢ ((𝑥 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ 𝑥) ∈ Word 𝐵)
11	7, 9, 10	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → (𝐴 ∘ 𝑥) ∈ Word 𝐵)
12		frmdup.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
13	12	gsumwcl 18716	. . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ (𝐴 ∘ 𝑥) ∈ Word 𝐵) → (𝐺 Σ_g (𝐴 ∘ 𝑥)) ∈ 𝐵)
14	6, 11, 13	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ Word 𝐼) → (𝐺 Σ_g (𝐴 ∘ 𝑥)) ∈ 𝐵)
15		frmdup.e	. . . . 5 ⊢ 𝐸 = (𝑥 ∈ Word 𝐼 ↦ (𝐺 Σ_g (𝐴 ∘ 𝑥)))
16	14, 15	fmptd 7110	. . . 4 ⊢ (𝜑 → 𝐸:Word 𝐼⟶𝐵)
17		eqid 2732	. . . . . . 7 ⊢ (Base‘𝑀) = (Base‘𝑀)
18	2, 17	frmdbas 18729	. . . . . 6 ⊢ (𝐼 ∈ 𝑋 → (Base‘𝑀) = Word 𝐼)
19	1, 18	syl 17	. . . . 5 ⊢ (𝜑 → (Base‘𝑀) = Word 𝐼)
20	19	feq2d 6700	. . . 4 ⊢ (𝜑 → (𝐸:(Base‘𝑀)⟶𝐵 ↔ 𝐸:Word 𝐼⟶𝐵))
21	16, 20	mpbird 256	. . 3 ⊢ (𝜑 → 𝐸:(Base‘𝑀)⟶𝐵)
22	2, 17	frmdelbas 18730	. . . . . . . . 9 ⊢ (𝑦 ∈ (Base‘𝑀) → 𝑦 ∈ Word 𝐼)
23	22	ad2antrl 726	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝑦 ∈ Word 𝐼)
24	2, 17	frmdelbas 18730	. . . . . . . . 9 ⊢ (𝑧 ∈ (Base‘𝑀) → 𝑧 ∈ Word 𝐼)
25	24	ad2antll 727	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝑧 ∈ Word 𝐼)
26	8	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝐴:𝐼⟶𝐵)
27		ccatco 14782	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝑧 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ (𝑦 ++ 𝑧)) = ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧)))
28	23, 25, 26, 27	syl3anc 1371	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐴 ∘ (𝑦 ++ 𝑧)) = ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧)))
29	28	oveq2d 7421	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐺 Σ_g (𝐴 ∘ (𝑦 ++ 𝑧))) = (𝐺 Σ_g ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧))))
30	5	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → 𝐺 ∈ Mnd)
31		wrdco 14778	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ 𝑦) ∈ Word 𝐵)
32	23, 26, 31	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐴 ∘ 𝑦) ∈ Word 𝐵)
33		wrdco 14778	. . . . . . . 8 ⊢ ((𝑧 ∈ Word 𝐼 ∧ 𝐴:𝐼⟶𝐵) → (𝐴 ∘ 𝑧) ∈ Word 𝐵)
34	25, 26, 33	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐴 ∘ 𝑧) ∈ Word 𝐵)
35		eqid 2732	. . . . . . . 8 ⊢ (+_g‘𝐺) = (+_g‘𝐺)
36	12, 35	gsumccat 18718	. . . . . . 7 ⊢ ((𝐺 ∈ Mnd ∧ (𝐴 ∘ 𝑦) ∈ Word 𝐵 ∧ (𝐴 ∘ 𝑧) ∈ Word 𝐵) → (𝐺 Σ_g ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧))) = ((𝐺 Σ_g (𝐴 ∘ 𝑦))(+_g‘𝐺)(𝐺 Σ_g (𝐴 ∘ 𝑧))))
37	30, 32, 34, 36	syl3anc 1371	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐺 Σ_g ((𝐴 ∘ 𝑦) ++ (𝐴 ∘ 𝑧))) = ((𝐺 Σ_g (𝐴 ∘ 𝑦))(+_g‘𝐺)(𝐺 Σ_g (𝐴 ∘ 𝑧))))
38	29, 37	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐺 Σ_g (𝐴 ∘ (𝑦 ++ 𝑧))) = ((𝐺 Σ_g (𝐴 ∘ 𝑦))(+_g‘𝐺)(𝐺 Σ_g (𝐴 ∘ 𝑧))))
39		eqid 2732	. . . . . . . . 9 ⊢ (+_g‘𝑀) = (+_g‘𝑀)
40	2, 17, 39	frmdadd 18732	. . . . . . . 8 ⊢ ((𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀)) → (𝑦(+_g‘𝑀)𝑧) = (𝑦 ++ 𝑧))
41	40	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝑦(+_g‘𝑀)𝑧) = (𝑦 ++ 𝑧))
42	41	fveq2d 6892	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦(+_g‘𝑀)𝑧)) = (𝐸‘(𝑦 ++ 𝑧)))
43		ccatcl 14520	. . . . . . . 8 ⊢ ((𝑦 ∈ Word 𝐼 ∧ 𝑧 ∈ Word 𝐼) → (𝑦 ++ 𝑧) ∈ Word 𝐼)
44	23, 25, 43	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝑦 ++ 𝑧) ∈ Word 𝐼)
45		coeq2 5856	. . . . . . . . 9 ⊢ (𝑥 = (𝑦 ++ 𝑧) → (𝐴 ∘ 𝑥) = (𝐴 ∘ (𝑦 ++ 𝑧)))
46	45	oveq2d 7421	. . . . . . . 8 ⊢ (𝑥 = (𝑦 ++ 𝑧) → (𝐺 Σ_g (𝐴 ∘ 𝑥)) = (𝐺 Σ_g (𝐴 ∘ (𝑦 ++ 𝑧))))
47		ovex 7438	. . . . . . . 8 ⊢ (𝐺 Σ_g (𝐴 ∘ 𝑥)) ∈ V
48	46, 15, 47	fvmpt3i 7000	. . . . . . 7 ⊢ ((𝑦 ++ 𝑧) ∈ Word 𝐼 → (𝐸‘(𝑦 ++ 𝑧)) = (𝐺 Σ_g (𝐴 ∘ (𝑦 ++ 𝑧))))
49	44, 48	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦 ++ 𝑧)) = (𝐺 Σ_g (𝐴 ∘ (𝑦 ++ 𝑧))))
50	42, 49	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦(+_g‘𝑀)𝑧)) = (𝐺 Σ_g (𝐴 ∘ (𝑦 ++ 𝑧))))
51		coeq2 5856	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐴 ∘ 𝑥) = (𝐴 ∘ 𝑦))
52	51	oveq2d 7421	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐺 Σ_g (𝐴 ∘ 𝑥)) = (𝐺 Σ_g (𝐴 ∘ 𝑦)))
53	52, 15, 47	fvmpt3i 7000	. . . . . . 7 ⊢ (𝑦 ∈ Word 𝐼 → (𝐸‘𝑦) = (𝐺 Σ_g (𝐴 ∘ 𝑦)))
54		coeq2 5856	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝐴 ∘ 𝑥) = (𝐴 ∘ 𝑧))
55	54	oveq2d 7421	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝐺 Σ_g (𝐴 ∘ 𝑥)) = (𝐺 Σ_g (𝐴 ∘ 𝑧)))
56	55, 15, 47	fvmpt3i 7000	. . . . . . 7 ⊢ (𝑧 ∈ Word 𝐼 → (𝐸‘𝑧) = (𝐺 Σ_g (𝐴 ∘ 𝑧)))
57	53, 56	oveqan12d 7424	. . . . . 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 2782	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ (Base‘𝑀) ∧ 𝑧 ∈ (Base‘𝑀))) → (𝐸‘(𝑦(+_g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+_g‘𝐺)(𝐸‘𝑧)))
60	59	ralrimivva 3200	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)(𝐸‘(𝑦(+_g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+_g‘𝐺)(𝐸‘𝑧)))
61		wrd0 14485	. . . 4 ⊢ ∅ ∈ Word 𝐼
62		coeq2 5856	. . . . . . . 8 ⊢ (𝑥 = ∅ → (𝐴 ∘ 𝑥) = (𝐴 ∘ ∅))
63		co02 6256	. . . . . . . 8 ⊢ (𝐴 ∘ ∅) = ∅
64	62, 63	eqtrdi 2788	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐴 ∘ 𝑥) = ∅)
65	64	oveq2d 7421	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐺 Σ_g (𝐴 ∘ 𝑥)) = (𝐺 Σ_g ∅))
66		eqid 2732	. . . . . . 7 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
67	66	gsum0 18599	. . . . . 6 ⊢ (𝐺 Σ_g ∅) = (0_g‘𝐺)
68	65, 67	eqtrdi 2788	. . . . 5 ⊢ (𝑥 = ∅ → (𝐺 Σ_g (𝐴 ∘ 𝑥)) = (0_g‘𝐺))
69	68, 15, 47	fvmpt3i 7000	. . . 4 ⊢ (∅ ∈ Word 𝐼 → (𝐸‘∅) = (0_g‘𝐺))
70	61, 69	mp1i 13	. . 3 ⊢ (𝜑 → (𝐸‘∅) = (0_g‘𝐺))
71	21, 60, 70	3jca 1128	. 2 ⊢ (𝜑 → (𝐸:(Base‘𝑀)⟶𝐵 ∧ ∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)(𝐸‘(𝑦(+_g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+_g‘𝐺)(𝐸‘𝑧)) ∧ (𝐸‘∅) = (0_g‘𝐺)))
72	2	frmd0 18737	. . 3 ⊢ ∅ = (0_g‘𝑀)
73	17, 12, 39, 35, 72, 66	ismhm 18669	. 2 ⊢ (𝐸 ∈ (𝑀 MndHom 𝐺) ↔ ((𝑀 ∈ Mnd ∧ 𝐺 ∈ Mnd) ∧ (𝐸:(Base‘𝑀)⟶𝐵 ∧ ∀𝑦 ∈ (Base‘𝑀)∀𝑧 ∈ (Base‘𝑀)(𝐸‘(𝑦(+_g‘𝑀)𝑧)) = ((𝐸‘𝑦)(+_g‘𝐺)(𝐸‘𝑧)) ∧ (𝐸‘∅) = (0_g‘𝐺))))
74	4, 5, 71, 73	syl21anbrc 1344	1 ⊢ (𝜑 → 𝐸 ∈ (𝑀 MndHom 𝐺))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∅c0 4321 ↦ cmpt 5230 ∘ ccom 5679 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 Word cword 14460 ++ cconcat 14516 Basecbs 17140 +_gcplusg 17193 0_gc0g 17381 Σ_g cgsu 17382 Mndcmnd 18621 MndHom cmhm 18665 freeMndcfrmd 18724

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-word 14461 df-concat 14517 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-0g 17383 df-gsum 17384 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-submnd 18668 df-frmd 18726

This theorem is referenced by: frmdup3 18744

W3C validator