Theorem gass 18423

Description: A subset of a group action is a group action iff it is closed under the group action operation. (Contributed by Mario Carneiro, 17-Jan-2015.)

Hypothesis

Ref	Expression
gass.1	⊢ 𝑋 = (Base‘𝐺)

Assertion

Ref	Expression
gass	⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍))

Distinct variable groups:   𝑥,𝑦,𝐺   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝑥,𝑍,𝑦   𝑥, ⊕ ,𝑦

Proof of Theorem gass

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

Step	Hyp	Ref	Expression
1		ovres 7294	. . . . 5 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍) → (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) = (𝑥 ⊕ 𝑦))
2	1	adantl 485	. . . 4 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍)) → (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) = (𝑥 ⊕ 𝑦))
3		gass.1	. . . . . . 7 ⊢ 𝑋 = (Base‘𝐺)
4	3	gaf 18417	. . . . . 6 ⊢ (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍)
5	4	adantl 485	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) → ( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍)
6	5	fovrnda 7299	. . . 4 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍)) → (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍)
7	2, 6	eqeltrrd 2891	. . 3 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍)) → (𝑥 ⊕ 𝑦) ∈ 𝑍)
8	7	ralrimivva 3156	. 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
9		gagrp 18414	. . . . 5 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
10	9	ad2antrr 725	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → 𝐺 ∈ Grp)
11		gaset 18415	. . . . . . 7 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝑌 ∈ V)
12	11	adantr 484	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → 𝑌 ∈ V)
13		simpr 488	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → 𝑍 ⊆ 𝑌)
14	12, 13	ssexd 5192	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → 𝑍 ∈ V)
15	14	adantr 484	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → 𝑍 ∈ V)
16	10, 15	jca 515	. . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (𝐺 ∈ Grp ∧ 𝑍 ∈ V))
17	3	gaf 18417	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
18	17	ad2antrr 725	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
19	18	ffnd 6488	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ⊕ Fn (𝑋 × 𝑌))
20		simplr 768	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → 𝑍 ⊆ 𝑌)
21		xpss2 5539	. . . . . . 7 ⊢ (𝑍 ⊆ 𝑌 → (𝑋 × 𝑍) ⊆ (𝑋 × 𝑌))
22	20, 21	syl 17	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (𝑋 × 𝑍) ⊆ (𝑋 × 𝑌))
23		fnssres 6442	. . . . . 6 ⊢ (( ⊕ Fn (𝑋 × 𝑌) ∧ (𝑋 × 𝑍) ⊆ (𝑋 × 𝑌)) → ( ⊕ ↾ (𝑋 × 𝑍)) Fn (𝑋 × 𝑍))
24	19, 22, 23	syl2anc 587	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)) Fn (𝑋 × 𝑍))
25		simpr 488	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
26	1	eleq1d 2874	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍) → ((𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍 ↔ (𝑥 ⊕ 𝑦) ∈ 𝑍))
27	26	ralbidva 3161	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → (∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍 ↔ ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍))
28	27	ralbiia 3132	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
29	25, 28	sylibr 237	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍)
30		ffnov 7257	. . . . 5 ⊢ (( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍 ↔ (( ⊕ ↾ (𝑋 × 𝑍)) Fn (𝑋 × 𝑍) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍))
31	24, 29, 30	sylanbrc 586	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍)
32		eqid 2798	. . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺)
33	3, 32	grpidcl 18123	. . . . . . . . 9 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
34	10, 33	syl 17	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (0g‘𝐺) ∈ 𝑋)
35		ovres 7294	. . . . . . . 8 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((0g‘𝐺) ⊕ 𝑧))
36	34, 35	sylan 583	. . . . . . 7 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((0g‘𝐺) ⊕ 𝑧))
37		simpll 766	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ⊕ ∈ (𝐺 GrpAct 𝑌))
38	20	sselda 3915	. . . . . . . 8 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → 𝑧 ∈ 𝑌)
39	32	gagrpid 18416	. . . . . . . 8 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑧 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑧) = 𝑧)
40	37, 38, 39	syl2an2r 684	. . . . . . 7 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺) ⊕ 𝑧) = 𝑧)
41	36, 40	eqtrd 2833	. . . . . 6 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧)
42	37	ad2antrr 725	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
43		simprl 770	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑢 ∈ 𝑋)
44		simprr 772	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑣 ∈ 𝑋)
45	38	adantr 484	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑧 ∈ 𝑌)
46		eqid 2798	. . . . . . . . . . 11 ⊢ (+g‘𝐺) = (+g‘𝐺)
47	3, 46	gaass 18419	. . . . . . . . . 10 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑌)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
48	42, 43, 44, 45, 47	syl13anc 1369	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
49		simplr 768	. . . . . . . . . . 11 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑧 ∈ 𝑍)
50		simpllr 775	. . . . . . . . . . 11 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
51		ovrspc2v 7161	. . . . . . . . . . 11 ⊢ (((𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (𝑣 ⊕ 𝑧) ∈ 𝑍)
52	44, 49, 50, 51	syl21anc 836	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑣 ⊕ 𝑧) ∈ 𝑍)
53		ovres 7294	. . . . . . . . . 10 ⊢ ((𝑢 ∈ 𝑋 ∧ (𝑣 ⊕ 𝑧) ∈ 𝑍) → (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
54	43, 52, 53	syl2anc 587	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
55	48, 54	eqtr4d 2836	. . . . . . . 8 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)))
56	10	ad2antrr 725	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝐺 ∈ Grp)
57	3, 46	grpcl 18103	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋) → (𝑢(+g‘𝐺)𝑣) ∈ 𝑋)
58	56, 43, 44, 57	syl3anc 1368	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢(+g‘𝐺)𝑣) ∈ 𝑋)
59		ovres 7294	. . . . . . . . 9 ⊢ (((𝑢(+g‘𝐺)𝑣) ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) → ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧))
60	58, 49, 59	syl2anc 587	. . . . . . . 8 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧))
61		ovres 7294	. . . . . . . . . 10 ⊢ ((𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) → (𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑣 ⊕ 𝑧))
62	44, 49, 61	syl2anc 587	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑣 ⊕ 𝑧))
63	62	oveq2d 7151	. . . . . . . 8 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)))
64	55, 60, 63	3eqtr4d 2843	. . . . . . 7 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)))
65	64	ralrimivva 3156	. . . . . 6 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)))
66	41, 65	jca 515	. . . . 5 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧))))
67	66	ralrimiva 3149	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ∀𝑧 ∈ 𝑍 (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧))))
68	31, 67	jca 515	. . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍 ∧ ∀𝑧 ∈ 𝑍 (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)))))
69	3, 46, 32	isga 18413	. . 3 ⊢ (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) ↔ ((𝐺 ∈ Grp ∧ 𝑍 ∈ V) ∧ (( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍 ∧ ∀𝑧 ∈ 𝑍 (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧))))))
70	16, 68, 69	sylanbrc 586	. 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍))
71	8, 70	impbida 800	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  Vcvv 3441   ⊆ wss 3881   × cxp 5517   ↾ cres 5521   Fn wfn 6319  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135  Basecbs 16475  +_gcplusg 16557  0_gc0g 16705  Grpcgrp 18095   GrpAct cga 18411

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-0g 16707  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-grp 18098  df-ga 18412

This theorem is referenced by: (None)