Theorem mhmco 18999

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 18963	. . 3 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → 𝑈 ∈ Mnd)
2		mhmrcl1 18962	. . 3 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
3	1, 2	anim12ci 626	. 2 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd))
4		eqid 2761	. . . . 5 ⊢ (Base‘𝑇) = (Base‘𝑇)
5		eqid 2761	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
6	4, 5	mhmf 18964	. . . 4 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → 𝐹:(Base‘𝑇)⟶(Base‘𝑈))
7		eqid 2761	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
8	7, 4	mhmf 18964	. . . 4 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
9		fco 6726	. . . 4 ⊢ ((𝐹:(Base‘𝑇)⟶(Base‘𝑈) ∧ 𝐺:(Base‘𝑆)⟶(Base‘𝑇)) → (𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈))
10	6, 8, 9	syl2an 608	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹 ∘ 𝐺):(Base‘𝑆)⟶(Base‘𝑈))
11		eqid 2761	. . . . . . . . . 10 ⊢ (+g‘𝑆) = (+g‘𝑆)
12		eqid 2761	. . . . . . . . . 10 ⊢ (+g‘𝑇) = (+g‘𝑇)
13	7, 11, 12	mhmlin 18968	. . . . . . . . 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 6881	. . . . . 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 7077	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘𝑥) ∈ (Base‘𝑇))
21		simprr 785	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → 𝑦 ∈ (Base‘𝑆))
22	18, 21	ffvelcdmd 7077	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐺‘𝑦) ∈ (Base‘𝑇))
23		eqid 2761	. . . . . . . 8 ⊢ (+g‘𝑈) = (+g‘𝑈)
24	4, 12, 23	mhmlin 18968	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ (𝐺‘𝑥) ∈ (Base‘𝑇) ∧ (𝐺‘𝑦) ∈ (Base‘𝑇)) → (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
25	17, 20, 22, 24	syl3anc 1398	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
26	16, 25	eqtrd 2796	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
27	2	adantl 487	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
28	7, 11	mndcl 18911	. . . . . . . 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 6977	. . . . . 6 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))))
32	18, 30, 31	syl2anc 596	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (𝐹‘(𝐺‘(𝑥(+g‘𝑆)𝑦))))
33		fvco3 6977	. . . . . . 7 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑥 ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
34	18, 19, 33	syl2anc 596	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
35		fvco3 6977	. . . . . . 7 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑦 ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
36	18, 21, 35	syl2anc 596	. . . . . 6 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
37	34, 36	oveq12d 7430	. . . . 5 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)) = ((𝐹‘(𝐺‘𝑥))(+g‘𝑈)(𝐹‘(𝐺‘𝑦))))
38	26, 32, 37	3eqtr4d 2806	. . . 4 ⊢ (((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)))
39	38	ralrimivva 3206	. . 3 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)((𝐹 ∘ 𝐺)‘(𝑥(+g‘𝑆)𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥)(+g‘𝑈)((𝐹 ∘ 𝐺)‘𝑦)))
40	8	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
41		eqid 2761	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
42	7, 41	mndidcl 18919	. . . . . 6 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ (Base‘𝑆))
43	27, 42	syl 18	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
44		fvco3 6977	. . . . 5 ⊢ ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ (0g‘𝑆) ∈ (Base‘𝑆)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (𝐹‘(𝐺‘(0g‘𝑆))))
45	40, 43, 44	syl2anc 596	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ((𝐹 ∘ 𝐺)‘(0g‘𝑆)) = (𝐹‘(𝐺‘(0g‘𝑆))))
46		eqid 2761	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
47	41, 46	mhm0 18969	. . . . . 6 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
48	47	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
49	48	fveq2d 6881	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(𝐺‘(0g‘𝑆))) = (𝐹‘(0g‘𝑇)))
50		eqid 2761	. . . . . 6 ⊢ (0g‘𝑈) = (0g‘𝑈)
51	46, 50	mhm0 18969	. . . . 5 ⊢ (𝐹 ∈ (𝑇 MndHom 𝑈) → (𝐹‘(0g‘𝑇)) = (0g‘𝑈))
52	51	adantr 486	. . . 4 ⊢ ((𝐹 ∈ (𝑇 MndHom 𝑈) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑇)) = (0g‘𝑈))
53	45, 49, 52	3eqtrd 2800	. . 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 18960	. 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 2145  ∀wral 3077   ∘ ccom 5655  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  +_gcplusg 17408  0_gc0g 17590  Mndcmnd 18903   MndHom cmhm 18956

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8833  df-0g 17592  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-mhm 18958

This theorem is used by:  ghmco  19430  rhmco  20719  zrhpsgnmhm  21870  lgseisenlem4  27687