Theorem lactghmga 19519

Description: The converse of galactghm 19518. The uncurrying of a homomorphism into (SymGrp‘𝑌) is a group action. Thus, group actions and group homomorphisms into a symmetric group are essentially equivalent notions. (Contributed by Mario Carneiro, 15-Jan-2015.)

Hypotheses

Ref	Expression
lactghmga.x	⊢ 𝑋 = (Base‘𝐺)
lactghmga.h	⊢ 𝐻 = (SymGrp‘𝑌)
lactghmga.f	⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ((𝐹‘𝑥)‘𝑦))

Assertion

Ref	Expression
lactghmga	⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ⊕ ∈ (𝐺 GrpAct 𝑌))

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦

Allowed substitution hints:   ⊕ (𝑥, 𝑦)

Proof of Theorem lactghmga

Dummy variables 𝑣 𝑢 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ghmgrp1 19332	. 2 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐺 ∈ Grp)
2		ghmgrp2 19333	. . 3 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐻 ∈ Grp)
3		grpn0 19082	. . 3 ⊢ (𝐻 ∈ Grp → 𝐻 ≠ ∅)
4		lactghmga.h	. . . . 5 ⊢ 𝐻 = (SymGrp‘𝑌)
5		fvprc 6877	. . . . 5 ⊢ (¬ 𝑌 ∈ V → (SymGrp‘𝑌) = ∅)
6	4, 5	eqtrid 2812	. . . 4 ⊢ (¬ 𝑌 ∈ V → 𝐻 = ∅)
7	6	necon1ai 2987	. . 3 ⊢ (𝐻 ≠ ∅ → 𝑌 ∈ V)
8	2, 3, 7	3syl 19	. 2 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝑌 ∈ V)
9		lactghmga.x	. . . . . . . . . . 11 ⊢ 𝑋 = (Base‘𝐺)
10		eqid 2765	. . . . . . . . . . 11 ⊢ (Base‘𝐻) = (Base‘𝐻)
11	9, 10	ghmf 19334	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → 𝐹:𝑋⟶(Base‘𝐻))
12	11	ffvelcdmda 7083	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ (Base‘𝐻))
13	8	adantr 486	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) → 𝑌 ∈ V)
14	4, 10	elsymgbas 19488	. . . . . . . . . 10 ⊢ (𝑌 ∈ V → ((𝐹‘𝑥) ∈ (Base‘𝐻) ↔ (𝐹‘𝑥):𝑌–1-1-onto→𝑌))
15	13, 14	syl 18	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) ∈ (Base‘𝐻) ↔ (𝐹‘𝑥):𝑌–1-1-onto→𝑌))
16	12, 15	mpbid 235	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥):𝑌–1-1-onto→𝑌)
17		f1of 6824	. . . . . . . 8 ⊢ ((𝐹‘𝑥):𝑌–1-1-onto→𝑌 → (𝐹‘𝑥):𝑌⟶𝑌)
18	16, 17	syl 18	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥):𝑌⟶𝑌)
19	18	ffvelcdmda 7083	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → ((𝐹‘𝑥)‘𝑦) ∈ 𝑌)
20	19	ralrimiva 3159	. . . . 5 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝑌 ((𝐹‘𝑥)‘𝑦) ∈ 𝑌)
21	20	ralrimiva 3159	. . . 4 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝐹‘𝑥)‘𝑦) ∈ 𝑌)
22		lactghmga.f	. . . . 5 ⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ ((𝐹‘𝑥)‘𝑦))
23	22	fmpo 8071	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝐹‘𝑥)‘𝑦) ∈ 𝑌 ↔ ⊕ :(𝑋 × 𝑌)⟶𝑌)
24	21, 23	sylib 221	. . 3 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
25		eqid 2765	. . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺)
26	9, 25	grpidcl 19076	. . . . . . . 8 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
27	1, 26	syl 18	. . . . . . 7 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → (0g‘𝐺) ∈ 𝑋)
28		fveq2 6885	. . . . . . . . 9 ⊢ (𝑥 = (0g‘𝐺) → (𝐹‘𝑥) = (𝐹‘(0g‘𝐺)))
29	28	fveq1d 6887	. . . . . . . 8 ⊢ (𝑥 = (0g‘𝐺) → ((𝐹‘𝑥)‘𝑦) = ((𝐹‘(0g‘𝐺))‘𝑦))
30		fveq2 6885	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ((𝐹‘(0g‘𝐺))‘𝑦) = ((𝐹‘(0g‘𝐺))‘𝑧))
31		fvex 6898	. . . . . . . 8 ⊢ ((𝐹‘(0g‘𝐺))‘𝑧) ∈ V
32	29, 30, 22, 31	ovmpo 7579	. . . . . . 7 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ 𝑧 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑧) = ((𝐹‘(0g‘𝐺))‘𝑧))
33	27, 32	sylan 592	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑧) = ((𝐹‘(0g‘𝐺))‘𝑧))
34		eqid 2765	. . . . . . . . . 10 ⊢ (0g‘𝐻) = (0g‘𝐻)
35	25, 34	ghmid 19336	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → (𝐹‘(0g‘𝐺)) = (0g‘𝐻))
36	35	adantr 486	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → (𝐹‘(0g‘𝐺)) = (0g‘𝐻))
37	8	adantr 486	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → 𝑌 ∈ V)
38	4	symgid 19515	. . . . . . . . 9 ⊢ (𝑌 ∈ V → ( I ↾ 𝑌) = (0g‘𝐻))
39	37, 38	syl 18	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → ( I ↾ 𝑌) = (0g‘𝐻))
40	36, 39	eqtr4d 2803	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → (𝐹‘(0g‘𝐺)) = ( I ↾ 𝑌))
41	40	fveq1d 6887	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → ((𝐹‘(0g‘𝐺))‘𝑧) = (( I ↾ 𝑌)‘𝑧))
42		fvresi 7177	. . . . . . 7 ⊢ (𝑧 ∈ 𝑌 → (( I ↾ 𝑌)‘𝑧) = 𝑧)
43	42	adantl 487	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → (( I ↾ 𝑌)‘𝑧) = 𝑧)
44	33, 41, 43	3eqtrd 2804	. . . . 5 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑧) = 𝑧)
45	11	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝐹:𝑋⟶(Base‘𝐻))
46		simprr 785	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑣 ∈ 𝑋)
47	45, 46	ffvelcdmd 7084	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝐹‘𝑣) ∈ (Base‘𝐻))
48	8	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑌 ∈ V)
49	4, 10	elsymgbas 19488	. . . . . . . . . . . 12 ⊢ (𝑌 ∈ V → ((𝐹‘𝑣) ∈ (Base‘𝐻) ↔ (𝐹‘𝑣):𝑌–1-1-onto→𝑌))
50	48, 49	syl 18	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝐹‘𝑣) ∈ (Base‘𝐻) ↔ (𝐹‘𝑣):𝑌–1-1-onto→𝑌))
51	47, 50	mpbid 235	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝐹‘𝑣):𝑌–1-1-onto→𝑌)
52		f1of 6824	. . . . . . . . . 10 ⊢ ((𝐹‘𝑣):𝑌–1-1-onto→𝑌 → (𝐹‘𝑣):𝑌⟶𝑌)
53	51, 52	syl 18	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝐹‘𝑣):𝑌⟶𝑌)
54		simplr 781	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑧 ∈ 𝑌)
55		fvco3 6985	. . . . . . . . 9 ⊢ (((𝐹‘𝑣):𝑌⟶𝑌 ∧ 𝑧 ∈ 𝑌) → (((𝐹‘𝑢) ∘ (𝐹‘𝑣))‘𝑧) = ((𝐹‘𝑢)‘((𝐹‘𝑣)‘𝑧)))
56	53, 54, 55	syl2anc 596	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (((𝐹‘𝑢) ∘ (𝐹‘𝑣))‘𝑧) = ((𝐹‘𝑢)‘((𝐹‘𝑣)‘𝑧)))
57		simpll 779	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
58		simprl 783	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑢 ∈ 𝑋)
59		eqid 2765	. . . . . . . . . . . 12 ⊢ (+g‘𝐺) = (+g‘𝐺)
60		eqid 2765	. . . . . . . . . . . 12 ⊢ (+g‘𝐻) = (+g‘𝐻)
61	9, 59, 60	ghmlin 19335	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋) → (𝐹‘(𝑢(+g‘𝐺)𝑣)) = ((𝐹‘𝑢)(+g‘𝐻)(𝐹‘𝑣)))
62	57, 58, 46, 61	syl3anc 1398	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝐹‘(𝑢(+g‘𝐺)𝑣)) = ((𝐹‘𝑢)(+g‘𝐻)(𝐹‘𝑣)))
63	45, 58	ffvelcdmd 7084	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝐹‘𝑢) ∈ (Base‘𝐻))
64	4, 10, 60	symgov 19498	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑢) ∈ (Base‘𝐻) ∧ (𝐹‘𝑣) ∈ (Base‘𝐻)) → ((𝐹‘𝑢)(+g‘𝐻)(𝐹‘𝑣)) = ((𝐹‘𝑢) ∘ (𝐹‘𝑣)))
65	63, 47, 64	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝐹‘𝑢)(+g‘𝐻)(𝐹‘𝑣)) = ((𝐹‘𝑢) ∘ (𝐹‘𝑣)))
66	62, 65	eqtrd 2800	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝐹‘(𝑢(+g‘𝐺)𝑣)) = ((𝐹‘𝑢) ∘ (𝐹‘𝑣)))
67	66	fveq1d 6887	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑧) = (((𝐹‘𝑢) ∘ (𝐹‘𝑣))‘𝑧))
68	53, 54	ffvelcdmd 7084	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝐹‘𝑣)‘𝑧) ∈ 𝑌)
69		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑢 → (𝐹‘𝑥) = (𝐹‘𝑢))
70	69	fveq1d 6887	. . . . . . . . . 10 ⊢ (𝑥 = 𝑢 → ((𝐹‘𝑥)‘𝑦) = ((𝐹‘𝑢)‘𝑦))
71		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑦 = ((𝐹‘𝑣)‘𝑧) → ((𝐹‘𝑢)‘𝑦) = ((𝐹‘𝑢)‘((𝐹‘𝑣)‘𝑧)))
72		fvex 6898	. . . . . . . . . 10 ⊢ ((𝐹‘𝑢)‘((𝐹‘𝑣)‘𝑧)) ∈ V
73	70, 71, 22, 72	ovmpo 7579	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝑋 ∧ ((𝐹‘𝑣)‘𝑧) ∈ 𝑌) → (𝑢 ⊕ ((𝐹‘𝑣)‘𝑧)) = ((𝐹‘𝑢)‘((𝐹‘𝑣)‘𝑧)))
74	58, 68, 73	syl2anc 596	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢 ⊕ ((𝐹‘𝑣)‘𝑧)) = ((𝐹‘𝑢)‘((𝐹‘𝑣)‘𝑧)))
75	56, 67, 74	3eqtr4d 2810	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑧) = (𝑢 ⊕ ((𝐹‘𝑣)‘𝑧)))
76	1	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝐺 ∈ Grp)
77	9, 59	grpcl 19052	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋) → (𝑢(+g‘𝐺)𝑣) ∈ 𝑋)
78	76, 58, 46, 77	syl3anc 1398	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢(+g‘𝐺)𝑣) ∈ 𝑋)
79		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑥 = (𝑢(+g‘𝐺)𝑣) → (𝐹‘𝑥) = (𝐹‘(𝑢(+g‘𝐺)𝑣)))
80	79	fveq1d 6887	. . . . . . . . 9 ⊢ (𝑥 = (𝑢(+g‘𝐺)𝑣) → ((𝐹‘𝑥)‘𝑦) = ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑦))
81		fveq2 6885	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑦) = ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑧))
82		fvex 6898	. . . . . . . . 9 ⊢ ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑧) ∈ V
83	80, 81, 22, 82	ovmpo 7579	. . . . . . . 8 ⊢ (((𝑢(+g‘𝐺)𝑣) ∈ 𝑋 ∧ 𝑧 ∈ 𝑌) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑧))
84	78, 54, 83	syl2anc 596	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = ((𝐹‘(𝑢(+g‘𝐺)𝑣))‘𝑧))
85		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑣 → (𝐹‘𝑥) = (𝐹‘𝑣))
86	85	fveq1d 6887	. . . . . . . . . 10 ⊢ (𝑥 = 𝑣 → ((𝐹‘𝑥)‘𝑦) = ((𝐹‘𝑣)‘𝑦))
87		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝐹‘𝑣)‘𝑦) = ((𝐹‘𝑣)‘𝑧))
88		fvex 6898	. . . . . . . . . 10 ⊢ ((𝐹‘𝑣)‘𝑧) ∈ V
89	86, 87, 22, 88	ovmpo 7579	. . . . . . . . 9 ⊢ ((𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑌) → (𝑣 ⊕ 𝑧) = ((𝐹‘𝑣)‘𝑧))
90	46, 54, 89	syl2anc 596	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑣 ⊕ 𝑧) = ((𝐹‘𝑣)‘𝑧))
91	90	oveq2d 7435	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢 ⊕ (𝑣 ⊕ 𝑧)) = (𝑢 ⊕ ((𝐹‘𝑣)‘𝑧)))
92	75, 84, 91	3eqtr4d 2810	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
93	92	ralrimivva 3210	. . . . 5 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
94	44, 93	jca 521	. . . 4 ⊢ ((𝐹 ∈ (𝐺 GrpHom 𝐻) ∧ 𝑧 ∈ 𝑌) → (((0g‘𝐺) ⊕ 𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧))))
95	94	ralrimiva 3159	. . 3 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ∀𝑧 ∈ 𝑌 (((0g‘𝐺) ⊕ 𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧))))
96	24, 95	jca 521	. 2 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑧 ∈ 𝑌 (((0g‘𝐺) ⊕ 𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))))
97	9, 59, 25	isga 19405	. 2 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) ↔ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) ∧ ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑧 ∈ 𝑌 (((0g‘𝐺) ⊕ 𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧))))))
98	1, 8, 96, 97	syl21anbrc 1363	1 ⊢ (𝐹 ∈ (𝐺 GrpHom 𝐻) → ⊕ ∈ (𝐺 GrpAct 𝑌))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∀wral 3081  Vcvv 3457  ∅c0 4286   I cid 5557   × cxp 5661   ↾ cres 5665   ∘ ccom 5667  ⟶wf 6536  –1-1-onto→wf1o 6539  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421  Basecbs 17291  +_gcplusg 17332  0_gc0g 17514  Grpcgrp 19044   GrpHom cghm 19327   GrpAct cga 19403  SymGrpcsymg 19483

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11171  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191  ax-pre-mulgt0 11192

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-pnf 11260  df-mnf 11261  df-xr 11262  df-ltxr 11263  df-le 11264  df-sub 11458  df-neg 11459  df-nn 12249  df-2 12318  df-3 12319  df-4 12320  df-5 12321  df-6 12322  df-7 12323  df-8 12324  df-9 12325  df-n0 12520  df-z 12607  df-uz 12879  df-fz 13552  df-struct 17229  df-sets 17246  df-slot 17264  df-ndx 17276  df-base 17292  df-ress 17313  df-plusg 17345  df-tset 17351  df-0g 17516  df-mgm 18720  df-sgrp 18809  df-mnd 18825  df-submnd 18879  df-efmnd 18965  df-grp 19047  df-ghm 19328  df-ga 19404  df-symg 19484

This theorem is used by:  symgga  19521