Theorem mhmco 18913

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 18877	. . 3 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → 𝑈 ∈ Mnd)
2		mhmrcl1 18876	. . 3 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
3	1, 2	anim12ci 626	. 2 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd))
4		eqid 2766	. . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇)
5		eqid 2766	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
6	4, 5	mhmf 18878	. . . 4 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → 𝐹:(Base‘𝑇)⟶(Base‘𝑈))
7		eqid 2766	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
8	7, 4	mhmf 18878	. . . 4 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
9		fco 6737	. . . 4 ⊢ ((𝐹:(Base‘𝑇)⟶(Base‘𝑈) ∧ 𝐺:(Base‘𝑆)⟶(Base‘𝑇)) → (𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈))
10	6, 8, 9	syl2an 608	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈))
11		eqid 2766	. . . . . . . . . 10 ⊢ (+g‘𝑆) = (+g‘𝑆)
12		eqid 2766	. . . . . . . . . 10 ⊢ (+g‘𝑇) = (+g‘𝑇)
13	7, 11, 12	mhmlin 18882	. . . . . . . . 9 ⊢ ((𝐺 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
14	13	3expb 1138	. . . . . . . 8 ⊢ ((𝐺 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
15	14	adantll 727	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
16	15	fveq2d 6892	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))) = (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))))
17		simpll 779	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝐹 ∈ (𝑇 MndHom 𝑈))
18	8	ad2antlr 740	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
19		simprl 783	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝑥 ∈ (Base‘𝑆))
20	18, 19	ffvelcdmd 7087	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘𝑥) ∈ (Base‘𝑇))
21		simprr 785	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝑦 ∈ (Base‘𝑆))
22	18, 21	ffvelcdmd 7087	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘𝑦) ∈ (Base‘𝑇))
23		eqid 2766	. . . . . . . 8 ⊢ (+g‘𝑈) = (+g‘𝑈)
24	4, 12, 23	mhmlin 18882	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ (𝐺‘𝑥) ∈ (Base‘𝑇) ∧ (𝐺‘𝑦) ∈ (Base‘𝑇)) → (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
25	17, 20, 22, 24	syl3anc 1398	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
26	16, 25	eqtrd 2801	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
27	2	adantl 487	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
28	7, 11	mndcl 18829	. . . . . . . 8 ⊢ ((𝑆 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
29	28	3expb 1138	. . . . . . 7 ⊢ ((𝑆 ∈ Mnd ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
30	27, 29	sylan 592	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
31		fvco3 6988	. . . . . 6 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))))
32	18, 30, 31	syl2anc 596	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))))
33		fvco3 6988	. . . . . . 7 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑥 ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
34	18, 19, 33	syl2anc 596	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
35		fvco3 6988	. . . . . . 7 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑦 ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
36	18, 21, 35	syl2anc 596	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
37	34, 36	oveq12d 7441	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
38	26, 32, 37	3eqtr4d 2811	. . . 4 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)))
39	38	ralrimivva 3211	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)))
40	8	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
41		eqid 2766	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
42	7, 41	mndidcl 18836	. . . . . 6 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ (Base‘𝑆))
43	27, 42	syl 18	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
44		fvco3 6988	. . . . 5 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ (0g‘𝑆) ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (𝐹‘(𝐺‘(0g‘𝑆))))
45	40, 43, 44	syl2anc 596	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (𝐹‘(𝐺‘(0g‘𝑆))))
46		eqid 2766	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
47	41, 46	mhm0 18883	. . . . . 6 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
48	47	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
49	48	fveq2d 6892	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(𝐺‘(0g‘𝑆))) = (𝐹‘(0g‘𝑇)))
50		eqid 2766	. . . . . 6 ⊢ (0g‘𝑈) = (0g‘𝑈)
51	46, 50	mhm0 18883	. . . . 5 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → (𝐹‘(0g‘𝑇)) = (0g‘𝑈))
52	51	adantr 486	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑇)) = (0g‘𝑈))
53	45, 49, 52	3eqtrd 2805	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (0g‘𝑈))
54	10, 39, 53	3jca 1146	. 2 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) ∧ ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (0g‘𝑈)))
55	7, 5, 11, 23, 41, 50	ismhm 18874	. 2 ⊢ ((𝐹 ∘ 𝐺) ∈ (𝑆 MndHom 𝑈) ↔ ((𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd) ∧ ((𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) ∧ ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (0g‘𝑈))))
56	3, 54, 55	sylanbrc 595	1 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹 ∘ 𝐺) ∈ (𝑆 MndHom 𝑈))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082   ∘ ccom 5670  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  +_gcplusg 17335  0_gc0g 17517  Mndcmnd 18821   MndHom cmhm 18870

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-map 8835  df-0g 17519  df-mgm 18723  df-sgrp 18806  df-mnd 18822  df-mhm 18872

This theorem is used by:  ghmco  19337  rhmco  20624  zrhpsgnmhm  21771  lgseisenlem4  27579