Theorem isghm 19008

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 19006	. . 3 ⊢ GrpHom = (𝑠 ∈ Grp, 𝑡 ∈ Grp ↦ {𝑓 ∣ [(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))})
2	1	elmpocl 7595	. 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑆 ∈ Grp ∧ 𝑇 ∈ Grp))
3		fvex 6855	. . . . . . . 8 ⊢ (Base‘𝑠) ∈ V
4		feq2 6650	. . . . . . . . 9 ⊢ (𝑤 = (Base‘𝑠) → (𝑓:𝑤⟶(Base‘𝑡) ↔ 𝑓:(Base‘𝑠)⟶(Base‘𝑡)))
5		raleq 3309	. . . . . . . . . 10 ⊢ (𝑤 = (Base‘𝑠) → (∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
6	5	raleqbi1dv 3307	. . . . . . . . 9 ⊢ (𝑤 = (Base‘𝑠) → (∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
7	4, 6	anbi12d 631	. . . . . . . 8 ⊢ (𝑤 = (Base‘𝑠) → ((𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:(Base‘𝑠)⟶(Base‘𝑡) ∧ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))))
8	3, 7	sbcie 3782	. . . . . . 7 ⊢ ([(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:(Base‘𝑠)⟶(Base‘𝑡) ∧ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
9		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
10		isghm.w	. . . . . . . . . 10 ⊢ 𝑋 = (Base‘𝑆)
11	9, 10	eqtr4di 2794	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (Base‘𝑠) = 𝑋)
12	11	feq2d 6654	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (𝑓:(Base‘𝑠)⟶(Base‘𝑡) ↔ 𝑓:𝑋⟶(Base‘𝑡)))
13		fveq2 6842	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑆 → (+g‘𝑠) = (+g‘𝑆))
14		isghm.a	. . . . . . . . . . . . 13 ⊢ + = (+g‘𝑆)
15	13, 14	eqtr4di 2794	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → (+g‘𝑠) = + )
16	15	oveqd 7374	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (𝑢(+g‘𝑠)𝑣) = (𝑢 + 𝑣))
17	16	fveqeq2d 6850	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → ((𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
18	11, 17	raleqbidv 3319	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
19	11, 18	raleqbidv 3319	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))))
20	12, 19	anbi12d 631	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((𝑓:(Base‘𝑠)⟶(Base‘𝑡) ∧ ∀𝑢 ∈ (Base‘𝑠)∀𝑣 ∈ (Base‘𝑠)(𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))))
21	8, 20	bitrid 282	. . . . . 6 ⊢ (𝑠 = 𝑆 → ([(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))))
22	21	abbidv 2805	. . . . 5 ⊢ (𝑠 = 𝑆 → {𝑓 ∣ [(Base‘𝑠) / 𝑤](𝑓:𝑤⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑤 ∀𝑣 ∈ 𝑤 (𝑓‘(𝑢(+g‘𝑠)𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))} = {𝑓 ∣ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))})
23		fveq2 6842	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
24		isghm.x	. . . . . . . . 9 ⊢ 𝑌 = (Base‘𝑇)
25	23, 24	eqtr4di 2794	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (Base‘𝑡) = 𝑌)
26	25	feq3d 6655	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑓:𝑋⟶(Base‘𝑡) ↔ 𝑓:𝑋⟶𝑌))
27		fveq2 6842	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → (+g‘𝑡) = (+g‘𝑇))
28		isghm.b	. . . . . . . . . . 11 ⊢ ⨣ = (+g‘𝑇)
29	27, 28	eqtr4di 2794	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (+g‘𝑡) = ⨣ )
30	29	oveqd 7374	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))
31	30	eqeq2d 2747	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → ((𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))))
32	31	2ralbidv 3212	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)) ↔ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))))
33	26, 32	anbi12d 631	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣))) ↔ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))))
34	33	abbidv 2805	. . . . 5 ⊢ (𝑡 = 𝑇 → {𝑓 ∣ (𝑓:𝑋⟶(Base‘𝑡) ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢)(+g‘𝑡)(𝑓‘𝑣)))} = {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))})
35	10	fvexi 6856	. . . . . . 7 ⊢ 𝑋 ∈ V
36	24	fvexi 6856	. . . . . . 7 ⊢ 𝑌 ∈ V
37		mapex 8771	. . . . . . 7 ⊢ ((𝑋 ∈ V ∧ 𝑌 ∈ V) → {𝑓 ∣ 𝑓:𝑋⟶𝑌} ∈ V)
38	35, 36, 37	mp2an 690	. . . . . 6 ⊢ {𝑓 ∣ 𝑓:𝑋⟶𝑌} ∈ V
39		simpl 483	. . . . . . 7 ⊢ ((𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))) → 𝑓:𝑋⟶𝑌)
40	39	ss2abi 4023	. . . . . 6 ⊢ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ⊆ {𝑓 ∣ 𝑓:𝑋⟶𝑌}
41	38, 40	ssexi 5279	. . . . 5 ⊢ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ∈ V
42	22, 34, 1, 41	ovmpo 7515	. . . 4 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))})
43	42	eleq2d 2823	. . 3 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))}))
44		fex 7176	. . . . . 6 ⊢ ((𝐹:𝑋⟶𝑌 ∧ 𝑋 ∈ V) → 𝐹 ∈ V)
45	35, 44	mpan2 689	. . . . 5 ⊢ (𝐹:𝑋⟶𝑌 → 𝐹 ∈ V)
46	45	adantr 481	. . . 4 ⊢ ((𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))) → 𝐹 ∈ V)
47		feq1 6649	. . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓:𝑋⟶𝑌 ↔ 𝐹:𝑋⟶𝑌))
48		fveq1 6841	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑢 + 𝑣)) = (𝐹‘(𝑢 + 𝑣)))
49		fveq1 6841	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑢) = (𝐹‘𝑢))
50		fveq1 6841	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑣) = (𝐹‘𝑣))
51	49, 50	oveq12d 7375	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))
52	48, 51	eqeq12d 2752	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)) ↔ (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))))
53	52	2ralbidv 3212	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)) ↔ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))))
54	47, 53	anbi12d 631	. . . 4 ⊢ (𝑓 = 𝐹 → ((𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣))) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))
55	46, 54	elab3 3638	. . 3 ⊢ (𝐹 ∈ {𝑓 ∣ (𝑓:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝑓‘(𝑢 + 𝑣)) = ((𝑓‘𝑢) ⨣ (𝑓‘𝑣)))} ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣))))
56	43, 55	bitrdi 286	. 2 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))
57	2, 56	biadanii 820	1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 (𝐹‘(𝑢 + 𝑣)) = ((𝐹‘𝑢) ⨣ (𝐹‘𝑣)))))

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  {cab 2713  ∀wral 3064  Vcvv 3445  [wsbc 3739  ⟶wf 6492  ‘cfv 6496  (class class class)co 7357  Basecbs 17083  +_gcplusg 17133  Grpcgrp 18748   GrpHom cghm 19005

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-ghm 19006

This theorem is referenced by:  isghm3  19009  ghmgrp1  19010  ghmgrp2  19011  ghmf  19012  ghmlin  19013  isghmd  19017  idghm  19023  ghmf1o  19038  rhmopp  20182  islmhm2  20499  expghm  20896  mulgghm2  20897  pi1xfr  24418  pi1coghm  24424  isrnghm  46180