Theorem mhmeql 13694

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 2232	. . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆)
2		eqid 2232	. . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇)
3	1, 2	mhmf 13667	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
4	3	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
5	4	ffnd 5508	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐹 Fn (Base‘𝑆))
6	1, 2	mhmf 13667	. . . . 5 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
7	6	adantl 277	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
8	7	ffnd 5508	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝐺 Fn (Base‘𝑆))
9		fndmin 5784	. . 3 ⊢ ((𝐹 Fn (Base‘𝑆) ∧ 𝐺 Fn (Base‘𝑆)) → dom (𝐹 ∩ 𝐺) = {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
10	5, 8, 9	syl2anc 411	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → dom (𝐹 ∩ 𝐺) = {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
11		ssrab2 3322	. . . 4 ⊢ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ⊆ (Base‘𝑆)
12	11	a1i 9	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ⊆ (Base‘𝑆))
13		fveq2 5669	. . . . 5 ⊢ (𝑧 = (0g‘𝑆) → (𝐹‘𝑧) = (𝐹‘(0g‘𝑆)))
14		fveq2 5669	. . . . 5 ⊢ (𝑧 = (0g‘𝑆) → (𝐺‘𝑧) = (𝐺‘(0g‘𝑆)))
15	13, 14	eqeq12d 2247	. . . 4 ⊢ (𝑧 = (0g‘𝑆) → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘(0g‘𝑆)) = (𝐺‘(0g‘𝑆))))
16		mhmrcl1 13665	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
17	16	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
18		eqid 2232	. . . . . 6 ⊢ (0g‘𝑆) = (0g‘𝑆)
19	1, 18	mndidcl 13632	. . . . 5 ⊢ (𝑆 ∈ Mnd → (0g‘𝑆) ∈ (Base‘𝑆))
20	17, 19	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ (Base‘𝑆))
21		eqid 2232	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
22	18, 21	mhm0 13670	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
23	22	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
24	18, 21	mhm0 13670	. . . . . 6 ⊢ (𝐺 ∈ (𝑆 MndHom 𝑇) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
25	24	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐺‘(0g‘𝑆)) = (0g‘𝑇))
26	23, 25	eqtr4d 2268	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (𝐺‘(0g‘𝑆)))
27	15, 20, 26	elrabd 2974	. . 3 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑆) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
28		fveq2 5669	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑥(+g‘𝑆)𝑦) → (𝐹‘𝑧) = (𝐹‘(𝑥(+g‘𝑆)𝑦)))
29		fveq2 5669	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑥(+g‘𝑆)𝑦) → (𝐺‘𝑧) = (𝐺‘(𝑥(+g‘𝑆)𝑦)))
30	28, 29	eqeq12d 2247	. . . . . . . . . 10 ⊢ (𝑧 = (𝑥(+g‘𝑆)𝑦) → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘(𝑥(+g‘𝑆)𝑦)) = (𝐺‘(𝑥(+g‘𝑆)𝑦))))
31	17	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝑆 ∈ Mnd)
32		simplrl 537	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝑥 ∈ (Base‘𝑆))
33		simprl 531	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝑦 ∈ (Base‘𝑆))
34		eqid 2232	. . . . . . . . . . . 12 ⊢ (+g‘𝑆) = (+g‘𝑆)
35	1, 34	mndcl 13625	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
36	31, 32, 33, 35	syl3anc 1274	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝑥(+g‘𝑆)𝑦) ∈ (Base‘𝑆))
37		simplll 535	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝐹 ∈ (𝑆 MndHom 𝑇))
38		eqid 2232	. . . . . . . . . . . . 13 ⊢ (+g‘𝑇) = (+g‘𝑇)
39	1, 34, 38	mhmlin 13669	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
40	37, 32, 33, 39	syl3anc 1274	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
41		simpllr 536	. . . . . . . . . . . . 13 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → 𝐺 ∈ (𝑆 MndHom 𝑇))
42	1, 34, 38	mhmlin 13669	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
43	41, 32, 33, 42	syl3anc 1274	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
44		simplrr 538	. . . . . . . . . . . . 13 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘𝑥) = (𝐺‘𝑥))
45		simprr 533	. . . . . . . . . . . . 13 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘𝑦) = (𝐺‘𝑦))
46	44, 45	oveq12d 6067	. . . . . . . . . . . 12 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) = ((𝐺‘𝑥)(+g‘𝑇)(𝐺‘𝑦)))
47	43, 46	eqtr4d 2268	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐺‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
48	40, 47	eqtr4d 2268	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = (𝐺‘(𝑥(+g‘𝑆)𝑦)))
49	30, 36, 48	elrabd 2974	. . . . . . . . 9 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ (𝑦 ∈ (Base‘𝑆) ∧ (𝐹‘𝑦) = (𝐺‘𝑦))) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)})
50	49	expr 375	. . . . . . . 8 ⊢ ((((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ∈ (Base‘𝑆)) → ((𝐹‘𝑦) = (𝐺‘𝑦) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
51	50	ralrimiva 2615	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ (𝐹‘𝑥) = (𝐺‘𝑥))) → ∀𝑦 ∈ (Base‘𝑆)((𝐹‘𝑦) = (𝐺‘𝑦) → (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
52		fveq2 5669	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝐹‘𝑧) = (𝐹‘𝑦))
53		fveq2 5669	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝐺‘𝑧) = (𝐺‘𝑦))
54	52, 53	eqeq12d 2247	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑦) = (𝐺‘𝑦)))
55	54	ralrab 2977	. . . . . . 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 2615	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)((𝐹‘𝑥) = (𝐺‘𝑥) → ∀𝑦 ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} (𝑥(+g‘𝑆)𝑦) ∈ {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)}))
59		fveq2 5669	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
60		fveq2 5669	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝐺‘𝑧) = (𝐺‘𝑥))
61	59, 60	eqeq12d 2247	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
62	61	ralrab 2977	. . . 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 13674	. . . 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 1207	. 2 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → {𝑧 ∈ (Base‘𝑆) ∣ (𝐹‘𝑧) = (𝐺‘𝑧)} ∈ (SubMnd‘𝑆))
67	10, 66	eqeltrd 2309	1 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝐺 ∈ (𝑆 MndHom 𝑇)) → dom (𝐹 ∩ 𝐺) ∈ (SubMnd‘𝑆))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203  ∀wral 2520  {crab 2524   ∩ cin 3209   ⊆ wss 3210  dom cdm 4748   Fn wfn 5346  ⟶wf 5347  ‘cfv 5351  (class class class)co 6049  Basecbs 13201  +_gcplusg 13279  0_gc0g 13458  Mndcmnd 13618   MndHom cmhm 13659  SubMndcsubmnd 13660

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1re 8217  ax-addrcl 8220

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-map 6883  df-inn 9234  df-2 9292  df-ndx 13204  df-slot 13205  df-base 13207  df-plusg 13292  df-0g 13460  df-mgm 13558  df-sgrp 13604  df-mnd 13619  df-mhm 13661  df-submnd 13662

This theorem is referenced by:  ghmeql  13973  rhmeql  14384