Theorem mhmeql 12736

Description: The equalizer of two monoid homomorphisms is a submonoid. (Contributed by Stefan O'Rear, 7-Mar-2015.) (Revised by Mario Carneiro, 6-May-2015.)

Assertion

Ref	Expression
mhmeql	⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → dom (𝐹 ∩ 𝐺) ∈ (SubMnd‘𝑆))

Proof of Theorem mhmeql

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

Step	Hyp	Ref	Expression
1		eqid 2175	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
2		eqid 2175	. . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇)
3	1, 2	mhmf 12717	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
4	3	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
5	4	ffnd 5358	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐹 Fn (Base‘𝑆))
6	1, 2	mhmf 12717	. . . . 5 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
7	6	adantl 277	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
8	7	ffnd 5358	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺 Fn (Base‘𝑆))
9		fndmin 5615	. . 3 ⊢ ((𝐹 Fn (Base‘𝑆) ∧ 𝐺 Fn (Base‘𝑆)) → dom (𝐹 ∩ 𝐺) = {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
10	5, 8, 9	syl2anc 411	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → dom (𝐹 ∩ 𝐺) = {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
11		ssrab2 3238	. . . 4 ⊢ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ⊆ (Base‘𝑆)
12	11	a1i 9	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ⊆ (Base‘𝑆))
13		fveq2 5507	. . . . 5 ⊢ (𝑧 = (0g‘𝑆) → (𝐹‘𝑧) = (𝐹‘(0g‘𝑆)))
14		fveq2 5507	. . . . 5 ⊢ (𝑧 = (0g‘𝑆) → (𝐺‘𝑧) = (𝐺‘(0g‘𝑆)))
15	13, 14	eqeq12d 2190	. . . 4 ⊢ (𝑧 = (0g‘𝑆) → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘(0g‘𝑆)) = (𝐺‘(0g‘𝑆))))
16		mhmrcl1 12715	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
17	16	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
18		eqid 2175	. . . . . 6 ⊢ (0g‘𝑆) = (0g‘𝑆)
19	1, 18	mndidcl 12695	. . . . 5 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ (Base‘𝑆))
20	17, 19	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
21		eqid 2175	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
22	18, 21	mhm0 12720	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
23	22	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
24	18, 21	mhm0 12720	. . . . . 6 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
25	24	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
26	23, 25	eqtr4d 2211	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (𝐺‘(0g‘𝑆)))
27	15, 20, 26	elrabd 2893	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
28		fveq2 5507	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑥(+g‘𝑆)𝑦) → (𝐹‘𝑧) = (𝐹‘(𝑥(+g‘𝑆)𝑦)))
29		fveq2 5507	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑥(+g‘𝑆)𝑦) → (𝐺‘𝑧) = (𝐺‘(𝑥(+g‘𝑆)𝑦)))
30	28, 29	eqeq12d 2190	. . . . . . . . . 10 ⊢ (𝑧 = (𝑥(+g‘𝑆)𝑦) → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘(𝑥(+g‘𝑆)𝑦)) = (𝐺‘(𝑥(+g‘𝑆)𝑦))))
31	17	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝑆 ∈ Mnd)
32		simplrl 535	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝑥 ∈ (Base‘𝑆))
33		simprl 529	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝑦 ∈ (Base‘𝑆))
34		eqid 2175	. . . . . . . . . . . 12 ⊢ (+g‘𝑆) = (+g‘𝑆)
35	1, 34	mndcl 12688	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
36	31, 32, 33, 35	syl3anc 1238	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
37		simplll 533	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝐹 ∈ (𝑆 MndHom 𝑇))
38		eqid 2175	. . . . . . . . . . . . 13 ⊢ (+g‘𝑇) = (+g‘𝑇)
39	1, 34, 38	mhmlin 12719	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
40	37, 32, 33, 39	syl3anc 1238	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
41		simpllr 534	. . . . . . . . . . . . 13 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝐺 ∈ (𝑆 MndHom 𝑇))
42	1, 34, 38	mhmlin 12719	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
43	41, 32, 33, 42	syl3anc 1238	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
44		simplrr 536	. . . . . . . . . . . . 13 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘𝑥) = (𝐺‘𝑥))
45		simprr 531	. . . . . . . . . . . . 13 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘𝑦) = (𝐺‘𝑦))
46	44, 45	oveq12d 5883	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
47	43, 46	eqtr4d 2211	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
48	40, 47	eqtr4d 2211	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = (𝐺‘(𝑥(+g‘𝑆)𝑦)))
49	30, 36, 48	elrabd 2893	. . . . . . . . 9 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
50	49	expr 375	. . . . . . . 8 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ∈ (Base‘𝑆)) → ((𝐹‘𝑦) = (𝐺‘𝑦) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
51	50	ralrimiva 2548	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) → ∀𝑦 ∈ (Base‘𝑆)((𝐹‘𝑦) = (𝐺‘𝑦) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
52		fveq2 5507	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝐹‘𝑧) = (𝐹‘𝑦))
53		fveq2 5507	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝐺‘𝑧) = (𝐺‘𝑦))
54	52, 53	eqeq12d 2190	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑦) = (𝐺‘𝑦)))
55	54	ralrab 2896	. . . . . . 7 ⊢ (∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ↔ ∀𝑦 ∈ (Base‘𝑆)((𝐹‘𝑦) = (𝐺‘𝑦) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
56	51, 55	sylibr 134	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) → ∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
57	56	expr 375	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ 𝑥 ∈ (Base‘𝑆)) → ((𝐹‘𝑥) = (𝐺‘𝑥) → ∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
58	57	ralrimiva 2548	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)((𝐹‘𝑥) = (𝐺‘𝑥) → ∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
59		fveq2 5507	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
60		fveq2 5507	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝐺‘𝑧) = (𝐺‘𝑥))
61	59, 60	eqeq12d 2190	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
62	61	ralrab 2896	. . . 4 ⊢ (∀𝑥 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ↔ ∀𝑥 ∈ (Base‘𝑆)((𝐹‘𝑥) = (𝐺‘𝑥) → ∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
63	58, 62	sylibr 134	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
64	1, 18, 34	issubm 12724	. . . 4 ⊢ (𝑆 ∈ Mnd → ({𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ∈ (SubMnd‘𝑆) ↔ ({𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ⊆ (Base‘𝑆) ∧ (0g‘𝑆) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ∧ ∀𝑥 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})))
65	17, 64	syl 14	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ({𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ∈ (SubMnd‘𝑆) ↔ ({𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ⊆ (Base‘𝑆) ∧ (0g‘𝑆) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ∧ ∀𝑥 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})))
66	12, 27, 63, 65	mpbir3and 1180	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ∈ (SubMnd‘𝑆))
67	10, 66	eqeltrd 2252	1 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → dom (𝐹 ∩ 𝐺) ∈ (SubMnd‘𝑆))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 978   = wceq 1353   ∈ wcel 2146  ∀wral 2453  {crab 2457   ∩ cin 3126   ⊆ wss 3127  dom cdm 4620   Fn wfn 5203  ⟶wf 5204  ‘cfv 5208  (class class class)co 5865  Basecbs 12427  +_gcplusg 12491  0_gc0g 12625  Mndcmnd 12681   MndHom cmhm 12710  SubMndcsubmnd 12711

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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1re 7880  ax-addrcl 7883

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-1st 6131  df-2nd 6132  df-map 6640  df-inn 8891  df-2 8949  df-ndx 12430  df-slot 12431  df-base 12433  df-plusg 12504  df-0g 12627  df-mgm 12639  df-sgrp 12672  df-mnd 12682  df-mhm 12712  df-submnd 12713

This theorem is referenced by: (None)