Theorem gass 18425

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 7308	. . . . 5 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍) → (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) = (𝑥 ⊕ 𝑦))
2	1	adantl 484	. . . 4 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍)) → (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) = (𝑥 ⊕ 𝑦))
3		gass.1	. . . . . . 7 ⊢ 𝑋 = (Base‘𝐺)
4	3	gaf 18419	. . . . . 6 ⊢ (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍)
5	4	adantl 484	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) → ( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍)
6	5	fovrnda 7313	. . . 4 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍)) → (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍)
7	2, 6	eqeltrrd 2914	. . 3 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍)) → (𝑥 ⊕ 𝑦) ∈ 𝑍)
8	7	ralrimivva 3191	. 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
9		gagrp 18416	. . . . 5 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
10	9	ad2antrr 724	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → 𝐺 ∈ Grp)
11		gaset 18417	. . . . . . 7 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝑌 ∈ V)
12	11	adantr 483	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → 𝑌 ∈ V)
13		simpr 487	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → 𝑍 ⊆ 𝑌)
14	12, 13	ssexd 5221	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → 𝑍 ∈ V)
15	14	adantr 483	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → 𝑍 ∈ V)
16	10, 15	jca 514	. . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (𝐺 ∈ Grp ∧ 𝑍 ∈ V))
17	3	gaf 18419	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
18	17	ad2antrr 724	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
19	18	ffnd 6510	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ⊕ Fn (𝑋 × 𝑌))
20		simplr 767	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → 𝑍 ⊆ 𝑌)
21		xpss2 5570	. . . . . . 7 ⊢ (𝑍 ⊆ 𝑌 → (𝑋 × 𝑍) ⊆ (𝑋 × 𝑌))
22	20, 21	syl 17	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (𝑋 × 𝑍) ⊆ (𝑋 × 𝑌))
23		fnssres 6465	. . . . . 6 ⊢ (( ⊕ Fn (𝑋 × 𝑌) ∧ (𝑋 × 𝑍) ⊆ (𝑋 × 𝑌)) → ( ⊕ ↾ (𝑋 × 𝑍)) Fn (𝑋 × 𝑍))
24	19, 22, 23	syl2anc 586	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)) Fn (𝑋 × 𝑍))
25		simpr 487	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
26	1	eleq1d 2897	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑍) → ((𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍 ↔ (𝑥 ⊕ 𝑦) ∈ 𝑍))
27	26	ralbidva 3196	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → (∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍 ↔ ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍))
28	27	ralbiia 3164	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
29	25, 28	sylibr 236	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍)
30		ffnov 7272	. . . . 5 ⊢ (( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍 ↔ (( ⊕ ↾ (𝑋 × 𝑍)) Fn (𝑋 × 𝑍) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥( ⊕ ↾ (𝑋 × 𝑍))𝑦) ∈ 𝑍))
31	24, 29, 30	sylanbrc 585	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍)
32		eqid 2821	. . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺)
33	3, 32	grpidcl 18125	. . . . . . . . 9 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
34	10, 33	syl 17	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (0g‘𝐺) ∈ 𝑋)
35		ovres 7308	. . . . . . . 8 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((0g‘𝐺) ⊕ 𝑧))
36	34, 35	sylan 582	. . . . . . 7 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((0g‘𝐺) ⊕ 𝑧))
37		simpll 765	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ⊕ ∈ (𝐺 GrpAct 𝑌))
38	20	sselda 3967	. . . . . . . 8 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → 𝑧 ∈ 𝑌)
39	32	gagrpid 18418	. . . . . . . 8 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑧 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑧) = 𝑧)
40	37, 38, 39	syl2an2r 683	. . . . . . 7 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺) ⊕ 𝑧) = 𝑧)
41	36, 40	eqtrd 2856	. . . . . 6 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧)
42	37	ad2antrr 724	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
43		simprl 769	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑢 ∈ 𝑋)
44		simprr 771	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑣 ∈ 𝑋)
45	38	adantr 483	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑧 ∈ 𝑌)
46		eqid 2821	. . . . . . . . . . 11 ⊢ (+g‘𝐺) = (+g‘𝐺)
47	3, 46	gaass 18421	. . . . . . . . . 10 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑌)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
48	42, 43, 44, 45, 47	syl13anc 1368	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
49		simplr 767	. . . . . . . . . . 11 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝑧 ∈ 𝑍)
50		simpllr 774	. . . . . . . . . . 11 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍)
51		ovrspc2v 7176	. . . . . . . . . . 11 ⊢ (((𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (𝑣 ⊕ 𝑧) ∈ 𝑍)
52	44, 49, 50, 51	syl21anc 835	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑣 ⊕ 𝑧) ∈ 𝑍)
53		ovres 7308	. . . . . . . . . 10 ⊢ ((𝑢 ∈ 𝑋 ∧ (𝑣 ⊕ 𝑧) ∈ 𝑍) → (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
54	43, 52, 53	syl2anc 586	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)) = (𝑢 ⊕ (𝑣 ⊕ 𝑧)))
55	48, 54	eqtr4d 2859	. . . . . . . 8 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)))
56	10	ad2antrr 724	. . . . . . . . . 10 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → 𝐺 ∈ Grp)
57	3, 46	grpcl 18105	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋) → (𝑢(+g‘𝐺)𝑣) ∈ 𝑋)
58	56, 43, 44, 57	syl3anc 1367	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢(+g‘𝐺)𝑣) ∈ 𝑋)
59		ovres 7308	. . . . . . . . 9 ⊢ (((𝑢(+g‘𝐺)𝑣) ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) → ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧))
60	58, 49, 59	syl2anc 586	. . . . . . . 8 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = ((𝑢(+g‘𝐺)𝑣) ⊕ 𝑧))
61		ovres 7308	. . . . . . . . . 10 ⊢ ((𝑣 ∈ 𝑋 ∧ 𝑧 ∈ 𝑍) → (𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑣 ⊕ 𝑧))
62	44, 49, 61	syl2anc 586	. . . . . . . . 9 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑣 ⊕ 𝑧))
63	62	oveq2d 7166	. . . . . . . 8 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣 ⊕ 𝑧)))
64	55, 60, 63	3eqtr4d 2866	. . . . . . 7 ⊢ ((((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) ∧ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)))
65	64	ralrimivva 3191	. . . . . 6 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)))
66	41, 65	jca 514	. . . . 5 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) ∧ 𝑧 ∈ 𝑍) → (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧))))
67	66	ralrimiva 3182	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ∀𝑧 ∈ 𝑍 (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧))))
68	31, 67	jca 514	. . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → (( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍 ∧ ∀𝑧 ∈ 𝑍 (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧)))))
69	3, 46, 32	isga 18415	. . 3 ⊢ (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) ↔ ((𝐺 ∈ Grp ∧ 𝑍 ∈ V) ∧ (( ⊕ ↾ (𝑋 × 𝑍)):(𝑋 × 𝑍)⟶𝑍 ∧ ∀𝑧 ∈ 𝑍 (((0g‘𝐺)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = 𝑧 ∧ ∀𝑢 ∈ 𝑋 ∀𝑣 ∈ 𝑋 ((𝑢(+g‘𝐺)𝑣)( ⊕ ↾ (𝑋 × 𝑍))𝑧) = (𝑢( ⊕ ↾ (𝑋 × 𝑍))(𝑣( ⊕ ↾ (𝑋 × 𝑍))𝑧))))))
70	16, 68, 69	sylanbrc 585	. 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍) → ( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍))
71	8, 70	impbida 799	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑍 ⊆ 𝑌) → (( ⊕ ↾ (𝑋 × 𝑍)) ∈ (𝐺 GrpAct 𝑍) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑍 (𝑥 ⊕ 𝑦) ∈ 𝑍))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  Vcvv 3495   ⊆ wss 3936   × cxp 5548   ↾ cres 5552   Fn wfn 6345  ⟶wf 6346  ‘cfv 6350  (class class class)co 7150  Basecbs 16477  +_gcplusg 16559  0_gc0g 16707  Grpcgrp 18097   GrpAct cga 18413

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-map 8402  df-0g 16709  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-grp 18100  df-ga 18414

This theorem is referenced by: (None)