Theorem isga 19362

Description: The predicate "is a (left) group action". The group 𝐺 is said to act on the base set 𝑌 of the action, which is not assumed to have any special properties. There is a related notion of right group action, but as the Wikipedia article explains, it is not mathematically interesting. The way actions are usually thought of is that each element 𝑔 of 𝐺 is a permutation of the elements of 𝑌 (see gapm 19377). Since group theory was classically about symmetry groups, it is therefore likely that the notion of group action was useful even in early group theory. (Contributed by Jeff Hankins, 10-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)

Hypotheses

Ref	Expression
isga.1	⊢ 𝑋 = (Base‘𝐺)
isga.2	⊢ + = (+g‘𝐺)
isga.3	⊢ 0 = (0g‘𝐺)

Assertion

Ref	Expression
isga	⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) ↔ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) ∧ ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))))

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

Allowed substitution hints:   + (𝑥,𝑦,𝑧)   𝑋(𝑥)   0 (𝑥,𝑦,𝑧)

Proof of Theorem isga

Dummy variables 𝑔 𝑏 𝑚 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ga 19361	. . 3 ⊢ GrpAct = (𝑔 ∈ Grp, 𝑠 ∈ V ↦ ⦋(Base‘𝑔) / 𝑏⦌{𝑚 ∈ (𝑠 ↑m (𝑏 × 𝑠)) ∣ ∀𝑥 ∈ 𝑠 (((0g‘𝑔)𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))})
2	1	elmpocl 7653	. 2 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → (𝐺 ∈ Grp ∧ 𝑌 ∈ V))
3		fvexd 6898	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) → (Base‘𝑔) ∈ V)
4		simplr 780	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → 𝑠 = 𝑌)
5		id 23	. . . . . . . . . . 11 ⊢ (𝑏 = (Base‘𝑔) → 𝑏 = (Base‘𝑔))
6		simpl 487	. . . . . . . . . . . . 13 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) → 𝑔 = 𝐺)
7	6	fveq2d 6887	. . . . . . . . . . . 12 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) → (Base‘𝑔) = (Base‘𝐺))
8		isga.1	. . . . . . . . . . . 12 ⊢ 𝑋 = (Base‘𝐺)
9	7, 8	eqtr4di 2816	. . . . . . . . . . 11 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) → (Base‘𝑔) = 𝑋)
10	5, 9	sylan9eqr 2820	. . . . . . . . . 10 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → 𝑏 = 𝑋)
11	10, 4	xpeq12d 5694	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (𝑏 × 𝑠) = (𝑋 × 𝑌))
12	4, 11	oveq12d 7430	. . . . . . . 8 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (𝑠 ↑m (𝑏 × 𝑠)) = (𝑌 ↑m (𝑋 × 𝑌)))
13		simpll 778	. . . . . . . . . . . . . 14 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → 𝑔 = 𝐺)
14	13	fveq2d 6887	. . . . . . . . . . . . 13 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (0g‘𝑔) = (0g‘𝐺))
15		isga.3	. . . . . . . . . . . . 13 ⊢ 0 = (0g‘𝐺)
16	14, 15	eqtr4di 2816	. . . . . . . . . . . 12 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (0g‘𝑔) = 0 )
17	16	oveq1d 7427	. . . . . . . . . . 11 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → ((0g‘𝑔)𝑚𝑥) = ( 0 𝑚𝑥))
18	17	eqeq1d 2765	. . . . . . . . . 10 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (((0g‘𝑔)𝑚𝑥) = 𝑥 ↔ ( 0 𝑚𝑥) = 𝑥))
19	13	fveq2d 6887	. . . . . . . . . . . . . . . 16 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (+g‘𝑔) = (+g‘𝐺))
20		isga.2	. . . . . . . . . . . . . . . 16 ⊢ + = (+g‘𝐺)
21	19, 20	eqtr4di 2816	. . . . . . . . . . . . . . 15 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (+g‘𝑔) = + )
22	21	oveqd 7429	. . . . . . . . . . . . . 14 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (𝑦(+g‘𝑔)𝑧) = (𝑦 + 𝑧))
23	22	oveq1d 7427	. . . . . . . . . . . . 13 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = ((𝑦 + 𝑧)𝑚𝑥))
24	23	eqeq1d 2765	. . . . . . . . . . . 12 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)) ↔ ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))))
25	10, 24	raleqbidv 3338	. . . . . . . . . . 11 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)) ↔ ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))))
26	10, 25	raleqbidv 3338	. . . . . . . . . 10 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))))
27	18, 26	anbi12d 643	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → ((((0g‘𝑔)𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))) ↔ (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))))
28	4, 27	raleqbidv 3338	. . . . . . . 8 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → (∀𝑥 ∈ 𝑠 (((0g‘𝑔)𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))) ↔ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))))
29	12, 28	rabeqbidv 3434	. . . . . . 7 ⊢ (((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) ∧ 𝑏 = (Base‘𝑔)) → {𝑚 ∈ (𝑠 ↑m (𝑏 × 𝑠)) ∣ ∀𝑥 ∈ 𝑠 (((0g‘𝑔)𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))} = {𝑚 ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∣ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))})
30	3, 29	csbied 3890	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑠 = 𝑌) → ⦋(Base‘𝑔) / 𝑏⦌{𝑚 ∈ (𝑠 ↑m (𝑏 × 𝑠)) ∣ ∀𝑥 ∈ 𝑠 (((0g‘𝑔)𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑏 ((𝑦(+g‘𝑔)𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))} = {𝑚 ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∣ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))})
31		ovex 7445	. . . . . . 7 ⊢ (𝑌 ↑m (𝑋 × 𝑌)) ∈ V
32	31	rabex 5311	. . . . . 6 ⊢ {𝑚 ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∣ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))} ∈ V
33	30, 1, 32	ovmpoa 7567	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → (𝐺 GrpAct 𝑌) = {𝑚 ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∣ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))})
34	33	eleq2d 2849	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → ( ⊕ ∈ (𝐺 GrpAct 𝑌) ↔ ⊕ ∈ {𝑚 ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∣ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))}))
35		oveq 7418	. . . . . . . 8 ⊢ (𝑚 = ⊕ → ( 0 𝑚𝑥) = ( 0 ⊕ 𝑥))
36	35	eqeq1d 2765	. . . . . . 7 ⊢ (𝑚 = ⊕ → (( 0 𝑚𝑥) = 𝑥 ↔ ( 0 ⊕ 𝑥) = 𝑥))
37		oveq 7418	. . . . . . . . 9 ⊢ (𝑚 = ⊕ → ((𝑦 + 𝑧)𝑚𝑥) = ((𝑦 + 𝑧) ⊕ 𝑥))
38		oveq 7418	. . . . . . . . . 10 ⊢ (𝑚 = ⊕ → (𝑦𝑚(𝑧𝑚𝑥)) = (𝑦 ⊕ (𝑧𝑚𝑥)))
39		oveq 7418	. . . . . . . . . . 11 ⊢ (𝑚 = ⊕ → (𝑧𝑚𝑥) = (𝑧 ⊕ 𝑥))
40	39	oveq2d 7428	. . . . . . . . . 10 ⊢ (𝑚 = ⊕ → (𝑦 ⊕ (𝑧𝑚𝑥)) = (𝑦 ⊕ (𝑧 ⊕ 𝑥)))
41	38, 40	eqtrd 2798	. . . . . . . . 9 ⊢ (𝑚 = ⊕ → (𝑦𝑚(𝑧𝑚𝑥)) = (𝑦 ⊕ (𝑧 ⊕ 𝑥)))
42	37, 41	eqeq12d 2779	. . . . . . . 8 ⊢ (𝑚 = ⊕ → (((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)) ↔ ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))
43	42	2ralbidv 3229	. . . . . . 7 ⊢ (𝑚 = ⊕ → (∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))
44	36, 43	anbi12d 643	. . . . . 6 ⊢ (𝑚 = ⊕ → ((( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))) ↔ (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥)))))
45	44	ralbidv 3188	. . . . 5 ⊢ (𝑚 = ⊕ → (∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥))) ↔ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥)))))
46	45	elrab 3651	. . . 4 ⊢ ( ⊕ ∈ {𝑚 ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∣ ∀𝑥 ∈ 𝑌 (( 0 𝑚𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧)𝑚𝑥) = (𝑦𝑚(𝑧𝑚𝑥)))} ↔ ( ⊕ ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥)))))
47	34, 46	bitrdi 290	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → ( ⊕ ∈ (𝐺 GrpAct 𝑌) ↔ ( ⊕ ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))))
48		simpr 489	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → 𝑌 ∈ V)
49	8	fvexi 6897	. . . . . 6 ⊢ 𝑋 ∈ V
50		xpexg 7750	. . . . . 6 ⊢ ((𝑋 ∈ V ∧ 𝑌 ∈ V) → (𝑋 × 𝑌) ∈ V)
51	49, 48, 50	sylancr 598	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → (𝑋 × 𝑌) ∈ V)
52	48, 51	elmapd 8838	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → ( ⊕ ∈ (𝑌 ↑m (𝑋 × 𝑌)) ↔ ⊕ :(𝑋 × 𝑌)⟶𝑌))
53	52	anbi1d 642	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → (( ⊕ ∈ (𝑌 ↑m (𝑋 × 𝑌)) ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥)))) ↔ ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))))
54	47, 53	bitrd 282	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) → ( ⊕ ∈ (𝐺 GrpAct 𝑌) ↔ ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))))
55	2, 54	biadanii 833	1 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) ↔ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) ∧ ( ⊕ :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥 ∈ 𝑌 (( 0 ⊕ 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ⊕ 𝑥) = (𝑦 ⊕ (𝑧 ⊕ 𝑥))))))

Syntax hints:   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  {crab 3416  Vcvv 3455  ⦋csb 3854   × cxp 5661  ⟶wf 6534  ‘cfv 6538  (class class class)co 7412   ↑_m cmap 8825  Basecbs 17270  +_gcplusg 17311  0_gc0g 17493  Grpcgrp 19001   GrpAct cga 19360

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8827  df-ga 19361

This theorem is referenced by:  gagrp  19363  gaset  19364  gagrpid  19365  gaf  19366  gaass  19368  ga0  19369  gaid  19370  subgga  19371  gass  19372  gasubg  19373  lactghmga  19476  sylow1lem2  19670  sylow2blem2  19692  sylow3lem1  19698  conjga  33471  mplvrpmga  33916