Theorem isghm 13829

Description: Property of being a homomorphism of groups. (Contributed by Stefan O'Rear, 31-Dec-2014.)

Hypotheses

Ref	Expression
isghm.w	⊢ 𝑋 = (Base‘𝑆)
isghm.x	⊢ 𝑌 = (Base‘𝑇)
isghm.a	⊢ + = (+g‘𝑆)
isghm.b	⊢ ⨣ = (+g‘𝑇)

Assertion

Ref	Expression
isghm	⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))

Distinct variable groups:   𝑣,𝑢,𝑆   𝑢,𝑇,𝑣   𝑢,𝑋,𝑣   𝑢, + ,𝑣   𝑢,𝑌,𝑣   𝑢, ⨣ ,𝑣   𝑢,𝐹,𝑣

Proof of Theorem isghm

Dummy variables 𝑡 𝑠 𝑤 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ghm 13827	. . 3 ⊢ GrpHom = (𝑠 ∈ Grp, 𝑡 ∈ Grp ↦ {𝑓 ∣ [(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))})
2	1	elmpocl 6216	. 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑆 ∈ Grp ∧ 𝑇 ∈ Grp))
3		isghm.w	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝑆)
4		basfn 13140	. . . . . . . . 9 ⊢ Base Fn V
5		elex 2814	. . . . . . . . . 10 ⊢ (𝑆 ∈ Grp → 𝑆 ∈ V)
6	5	adantr 276	. . . . . . . . 9 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → 𝑆 ∈ V)
7		funfvex 5656	. . . . . . . . . 10 ⊢ ((Fun Base ∧ 𝑆 ∈ dom Base) → (Base‘𝑆) ∈ V)
8	7	funfni 5432	. . . . . . . . 9 ⊢ ((Base Fn V ∧ 𝑆 ∈ V) → (Base‘𝑆) ∈ V)
9	4, 6, 8	sylancr 414	. . . . . . . 8 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (Base‘𝑆) ∈ V)
10	3, 9	eqeltrid 2318	. . . . . . 7 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → 𝑋 ∈ V)
11		isghm.x	. . . . . . . 8 ⊢ 𝑌 = (Base‘𝑇)
12		elex 2814	. . . . . . . . . 10 ⊢ (𝑇 ∈ Grp → 𝑇 ∈ V)
13	12	adantl 277	. . . . . . . . 9 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → 𝑇 ∈ V)
14		funfvex 5656	. . . . . . . . . 10 ⊢ ((Fun Base ∧ 𝑇 ∈ dom Base) → (Base‘𝑇) ∈ V)
15	14	funfni 5432	. . . . . . . . 9 ⊢ ((Base Fn V ∧ 𝑇 ∈ V) → (Base‘𝑇) ∈ V)
16	4, 13, 15	sylancr 414	. . . . . . . 8 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (Base‘𝑇) ∈ V)
17	11, 16	eqeltrid 2318	. . . . . . 7 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → 𝑌 ∈ V)
18		mapex 6822	. . . . . . 7 ⊢ ((𝑋 ∈ V ∧ 𝑌 ∈ V) → {𝑓 ∣ 𝑓:𝑋⟶𝑌} ∈ V)
19	10, 17, 18	syl2anc 411	. . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → {𝑓 ∣ 𝑓:𝑋⟶𝑌} ∈ V)
20		simpl 109	. . . . . . . 8 ⊢ ((𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))) → 𝑓:𝑋⟶𝑌)
21	20	ss2abi 3299	. . . . . . 7 ⊢ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ⊆ {𝑓 ∣ 𝑓:𝑋⟶𝑌}
22	21	a1i 9	. . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ⊆ {𝑓 ∣ 𝑓:𝑋⟶𝑌})
23	19, 22	ssexd 4229	. . . . 5 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ∈ V)
24		vex 2805	. . . . . . . . . 10 ⊢ 𝑠 ∈ V
25		funfvex 5656	. . . . . . . . . . 11 ⊢ ((Fun Base ∧ 𝑠 ∈ dom Base) → (Base‘𝑠) ∈ V)
26	25	funfni 5432	. . . . . . . . . 10 ⊢ ((Base Fn V ∧ 𝑠 ∈ V) → (Base‘𝑠) ∈ V)
27	4, 24, 26	mp2an 426	. . . . . . . . 9 ⊢ (Base‘𝑠) ∈ V
28		feq2 5466	. . . . . . . . . 10 ⊢ (𝑤 = (Base‘𝑠) → (𝑓:𝑤⟶(Base‘𝑡) ↔ 𝑓:(Base‘𝑠)⟶(Base‘𝑡)))
29		raleq 2730	. . . . . . . . . . 11 ⊢ (𝑤 = (Base‘𝑠) → (∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
30	29	raleqbi1dv 2742	. . . . . . . . . 10 ⊢ (𝑤 = (Base‘𝑠) → (∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
31	28, 30	anbi12d 473	. . . . . . . . 9 ⊢ (𝑤 = (Base‘𝑠) → ((𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:(Base‘𝑠)⟶(Base‘𝑡) ∧ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))))
32	27, 31	sbcie 3066	. . . . . . . 8 ⊢ ([(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:(Base‘𝑠)⟶(Base‘𝑡) ∧ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
33		fveq2 5639	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
34	33, 3	eqtr4di 2282	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (Base‘𝑠) = 𝑋)
35	34	feq2d 5470	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (𝑓:(Base‘𝑠)⟶(Base‘𝑡) ↔ 𝑓:𝑋⟶(Base‘𝑡)))
36		fveq2 5639	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑆 → (+g‘𝑠) = (+g‘𝑆))
37		isghm.a	. . . . . . . . . . . . . 14 ⊢ + = (+g‘𝑆)
38	36, 37	eqtr4di 2282	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑆 → (+g‘𝑠) = + )
39	38	oveqd 6034	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → (𝑢(+g‘𝑠)𝑣) = (𝑢 + 𝑣))
40	39	fveqeq2d 5647	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → ((𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
41	34, 40	raleqbidv 2746	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
42	34, 41	raleqbidv 2746	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
43	35, 42	anbi12d 473	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((𝑓:(Base‘𝑠)⟶(Base‘𝑡) ∧ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))))
44	32, 43	bitrid 192	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ([(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))))
45	44	abbidv 2349	. . . . . 6 ⊢ (𝑠 = 𝑆 → {𝑓 ∣ [(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))} = {𝑓 ∣ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))})
46		fveq2 5639	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
47	46, 11	eqtr4di 2282	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (Base‘𝑡) = 𝑌)
48	47	feq3d 5471	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑓:𝑋⟶(Base‘𝑡) ↔ 𝑓:𝑋⟶𝑌))
49		fveq2 5639	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑇 → (+g‘𝑡) = (+g‘𝑇))
50		isghm.b	. . . . . . . . . . . 12 ⊢ ⨣ = (+g‘𝑇)
51	49, 50	eqtr4di 2282	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → (+g‘𝑡) = ⨣ )
52	51	oveqd 6034	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))
53	52	eqeq2d 2243	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))))
54	53	2ralbidv 2556	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))))
55	48, 54	anbi12d 473	. . . . . . 7 ⊢ (𝑡 = 𝑇 → ((𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))))
56	55	abbidv 2349	. . . . . 6 ⊢ (𝑡 = 𝑇 → {𝑓 ∣ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))} = {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))})
57	45, 56, 1	ovmpog 6155	. . . . 5 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp ∧ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ∈ V) → (𝑆 GrpHom 𝑇) = {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))})
58	23, 57	mpd3an3 1374	. . . 4 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))})
59	58	eleq2d 2301	. . 3 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))}))
60		simpr 110	. . . . . . 7 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝐹:𝑋⟶𝑌) → 𝐹:𝑋⟶𝑌)
61	10	adantr 276	. . . . . . 7 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝐹:𝑋⟶𝑌) → 𝑋 ∈ V)
62	60, 61	fexd 5883	. . . . . 6 ⊢ (((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ 𝐹:𝑋⟶𝑌) → 𝐹 ∈ V)
63	62	ex 115	. . . . 5 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝐹:𝑋⟶𝑌 → 𝐹 ∈ V))
64	63	adantrd 279	. . . 4 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))) → 𝐹 ∈ V))
65		feq1 5465	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓:𝑋⟶𝑌 ↔ 𝐹:𝑋⟶𝑌))
66		fveq1 5638	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑢 + 𝑣)) = (𝐹‘(𝑢 + 𝑣)))
67		fveq1 5638	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑢) = (𝐹‘𝑢))
68		fveq1 5638	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑣) = (𝐹‘𝑣))
69	67, 68	oveq12d 6035	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))
70	66, 69	eqeq12d 2246	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)) ↔ (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))))
71	70	2ralbidv 2556	. . . . . 6 ⊢ (𝑓 = 𝐹 → (∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)) ↔ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))))
72	65, 71	anbi12d 473	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))
73	72	elab3g 2957	. . . 4 ⊢ (((𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))) → 𝐹 ∈ V) → (𝐹 ∈ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))
74	64, 73	syl 14	. . 3 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝐹 ∈ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))
75	59, 74	bitrd 188	. 2 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))
76	2, 75	biadanii 617	1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202  {cab 2217  ∀wral 2510  Vcvv 2802  [wsbc 3031   ⊆ wss 3200   Fn wfn 5321  ⟶wf 5322  ‘cfv 5326  (class class class)co 6017  Basecbs 13081  +_gcplusg 13159  Grpcgrp 13582   GrpHom cghm 13826

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-inn 9143  df-ndx 13084  df-slot 13085  df-base 13087  df-ghm 13827

This theorem is referenced by:  isghm3  13830  ghmgrp1  13831  ghmgrp2  13832  ghmf  13833  ghmlin  13834  isghmd  13838  idghm  13845  ghmf1o  13861  rhmopp  14189  expghmap  14620  mulgghm2  14621