Theorem mhmco 13192

Description: The composition of monoid homomorphisms is a homomorphism. (Contributed by Mario Carneiro, 12-Jun-2015.)

Assertion

Ref	Expression
mhmco	⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹 ∘ 𝐺) ∈ (𝑆 MndHom 𝑈))

Proof of Theorem mhmco

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

Step	Hyp	Ref	Expression
1		mhmrcl2 13166	. . 3 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → 𝑈 ∈ Mnd)
2		mhmrcl1 13165	. . 3 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
3	1, 2	anim12ci 339	. 2 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd))
4		eqid 2196	. . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇)
5		eqid 2196	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
6	4, 5	mhmf 13167	. . . 4 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → 𝐹:(Base‘𝑇)⟶(Base‘𝑈))
7		eqid 2196	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
8	7, 4	mhmf 13167	. . . 4 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
9		fco 5426	. . . 4 ⊢ ((𝐹:(Base‘𝑇)⟶(Base‘𝑈) ∧ 𝐺:(Base‘𝑆)⟶(Base‘𝑇)) → (𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈))
10	6, 8, 9	syl2an 289	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈))
11		eqid 2196	. . . . . . . . . 10 ⊢ (+g‘𝑆) = (+g‘𝑆)
12		eqid 2196	. . . . . . . . . 10 ⊢ (+g‘𝑇) = (+g‘𝑇)
13	7, 11, 12	mhmlin 13169	. . . . . . . . 9 ⊢ ((𝐺 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
14	13	3expb 1206	. . . . . . . 8 ⊢ ((𝐺 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
15	14	adantll 476	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
16	15	fveq2d 5565	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))) = (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))))
17		simpll 527	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝐹 ∈ (𝑇 MndHom 𝑈))
18	8	ad2antlr 489	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
19		simprl 529	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝑥 ∈ (Base‘𝑆))
20	18, 19	ffvelcdmd 5701	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘𝑥) ∈ (Base‘𝑇))
21		simprr 531	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝑦 ∈ (Base‘𝑆))
22	18, 21	ffvelcdmd 5701	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘𝑦) ∈ (Base‘𝑇))
23		eqid 2196	. . . . . . . 8 ⊢ (+g‘𝑈) = (+g‘𝑈)
24	4, 12, 23	mhmlin 13169	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ (𝐺‘𝑥) ∈ (Base‘𝑇) ∧ (𝐺‘𝑦) ∈ (Base‘𝑇)) → (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
25	17, 20, 22, 24	syl3anc 1249	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
26	16, 25	eqtrd 2229	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
27	2	adantl 277	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
28	7, 11	mndcl 13125	. . . . . . . 8 ⊢ ((𝑆 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
29	28	3expb 1206	. . . . . . 7 ⊢ ((𝑆 ∈ Mnd ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
30	27, 29	sylan 283	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
31		fvco3 5635	. . . . . 6 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))))
32	18, 30, 31	syl2anc 411	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))))
33		fvco3 5635	. . . . . . 7 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑥 ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
34	18, 19, 33	syl2anc 411	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
35		fvco3 5635	. . . . . . 7 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑦 ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
36	18, 21, 35	syl2anc 411	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
37	34, 36	oveq12d 5943	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
38	26, 32, 37	3eqtr4d 2239	. . . 4 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)))
39	38	ralrimivva 2579	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)))
40	8	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
41		eqid 2196	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
42	7, 41	mndidcl 13132	. . . . . 6 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ (Base‘𝑆))
43	27, 42	syl 14	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
44		fvco3 5635	. . . . 5 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ (0g‘𝑆) ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (𝐹‘(𝐺‘(0g‘𝑆))))
45	40, 43, 44	syl2anc 411	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (𝐹‘(𝐺‘(0g‘𝑆))))
46		eqid 2196	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
47	41, 46	mhm0 13170	. . . . . 6 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
48	47	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
49	48	fveq2d 5565	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(𝐺‘(0g‘𝑆))) = (𝐹‘(0g‘𝑇)))
50		eqid 2196	. . . . . 6 ⊢ (0g‘𝑈) = (0g‘𝑈)
51	46, 50	mhm0 13170	. . . . 5 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → (𝐹‘(0g‘𝑇)) = (0g‘𝑈))
52	51	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑇)) = (0g‘𝑈))
53	45, 49, 52	3eqtrd 2233	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (0g‘𝑈))
54	10, 39, 53	3jca 1179	. 2 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) ∧ ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (0g‘𝑈)))
55	7, 5, 11, 23, 41, 50	ismhm 13163	. 2 ⊢ ((𝐹 ∘ 𝐺) ∈ (𝑆 MndHom 𝑈) ↔ ((𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd) ∧ ((𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) ∧ ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (0g‘𝑈))))
56	3, 54, 55	sylanbrc 417	1 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹 ∘ 𝐺) ∈ (𝑆 MndHom 𝑈))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  ∀wral 2475   ∘ ccom 4668  ⟶wf 5255  ‘cfv 5259  (class class class)co 5925  Basecbs 12703  +_gcplusg 12780  0_gc0g 12958  Mndcmnd 13118   MndHom cmhm 13159

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-mhm 13161

This theorem is referenced by:  ghmco  13470  rhmco  13806  lgseisenlem4  15398