Theorem isgrpo 30584

Description: The predicate "is a group operation." Note that 𝑋 is the base set of the group. (Contributed by NM, 10-Oct-2006.) (New usage is discouraged.)

Hypothesis

Ref	Expression
isgrp.1	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
isgrpo	⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))

Distinct variable groups:   𝑥,𝑢,𝑦,𝑧,𝐺   𝑢,𝑋,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑢)

Proof of Theorem isgrpo

Dummy variables 𝑡 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		feq1 6648	. . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔:(𝑡 × 𝑡)⟶𝑡 ↔ 𝐺:(𝑡 × 𝑡)⟶𝑡))
2		oveq 7374	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((𝑥𝑔𝑦)𝑔𝑧) = ((𝑥𝑔𝑦)𝐺𝑧))
3		oveq 7374	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
4	3	oveq1d 7383	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((𝑥𝑔𝑦)𝐺𝑧) = ((𝑥𝐺𝑦)𝐺𝑧))
5	2, 4	eqtrd 2772	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ((𝑥𝑔𝑦)𝑔𝑧) = ((𝑥𝐺𝑦)𝐺𝑧))
6		oveq 7374	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑥𝑔(𝑦𝑔𝑧)) = (𝑥𝐺(𝑦𝑔𝑧)))
7		oveq 7374	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑧) = (𝑦𝐺𝑧))
8	7	oveq2d 7384	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑥𝐺(𝑦𝑔𝑧)) = (𝑥𝐺(𝑦𝐺𝑧)))
9	6, 8	eqtrd 2772	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑥𝑔(𝑦𝑔𝑧)) = (𝑥𝐺(𝑦𝐺𝑧)))
10	5, 9	eqeq12d 2753	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ↔ ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
11	10	ralbidv 3161	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ↔ ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
12	11	2ralbidv 3202	. . . . . 6 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ↔ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
13		oveq 7374	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑢𝑔𝑥) = (𝑢𝐺𝑥))
14	13	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((𝑢𝑔𝑥) = 𝑥 ↔ (𝑢𝐺𝑥) = 𝑥))
15		oveq 7374	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥))
16	15	eqeq1d 2739	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑢))
17	16	rexbidv 3162	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))
18	14, 17	anbi12d 633	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢) ↔ ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)))
19	18	rexralbidv 3204	. . . . . 6 ⊢ (𝑔 = 𝐺 → (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢) ↔ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)))
20	1, 12, 19	3anbi123d 1439	. . . . 5 ⊢ (𝑔 = 𝐺 → ((𝑔:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢)) ↔ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
21	20	exbidv 1923	. . . 4 ⊢ (𝑔 = 𝐺 → (∃𝑡(𝑔:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢)) ↔ ∃𝑡(𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
22		df-grpo 30580	. . . 4 ⊢ GrpOp = {𝑔 ∣ ∃𝑡(𝑔:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢))}
23	21, 22	elab2g 3637	. . 3 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ GrpOp ↔ ∃𝑡(𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
24		simpl 482	. . . . . . . . . . . . . 14 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → (𝑢𝐺𝑥) = 𝑥)
25	24	ralimi 3075	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∀𝑥 ∈ 𝑡 (𝑢𝐺𝑥) = 𝑥)
26		oveq2 7376	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → (𝑢𝐺𝑥) = (𝑢𝐺𝑧))
27		id 22	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
28	26, 27	eqeq12d 2753	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑢𝐺𝑧) = 𝑧))
29		eqcom 2744	. . . . . . . . . . . . . . . 16 ⊢ ((𝑢𝐺𝑧) = 𝑧 ↔ 𝑧 = (𝑢𝐺𝑧))
30	28, 29	bitrdi 287	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → ((𝑢𝐺𝑥) = 𝑥 ↔ 𝑧 = (𝑢𝐺𝑧)))
31	30	rspcv 3574	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝑡 → (∀𝑥 ∈ 𝑡 (𝑢𝐺𝑥) = 𝑥 → 𝑧 = (𝑢𝐺𝑧)))
32		oveq2 7376	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑧 → (𝑢𝐺𝑦) = (𝑢𝐺𝑧))
33	32	rspceeqv 3601	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝑡 ∧ 𝑧 = (𝑢𝐺𝑧)) → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦))
34	33	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝑡 → (𝑧 = (𝑢𝐺𝑧) → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
35	31, 34	syld 47	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑡 → (∀𝑥 ∈ 𝑡 (𝑢𝐺𝑥) = 𝑥 → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
36	25, 35	syl5 34	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑡 → (∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
37	36	reximdv 3153	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑡 → (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
38	37	impcom 407	. . . . . . . . . 10 ⊢ ((∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ∧ 𝑧 ∈ 𝑡) → ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦))
39	38	ralrimiva 3130	. . . . . . . . 9 ⊢ (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∀𝑧 ∈ 𝑡 ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦))
40	39	anim2i 618	. . . . . . . 8 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑧 ∈ 𝑡 ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
41		foov 7542	. . . . . . . 8 ⊢ (𝐺:(𝑡 × 𝑡)–onto→𝑡 ↔ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑧 ∈ 𝑡 ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
42	40, 41	sylibr 234	. . . . . . 7 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → 𝐺:(𝑡 × 𝑡)–onto→𝑡)
43		forn 6757	. . . . . . . 8 ⊢ (𝐺:(𝑡 × 𝑡)–onto→𝑡 → ran 𝐺 = 𝑡)
44	43	eqcomd 2743	. . . . . . 7 ⊢ (𝐺:(𝑡 × 𝑡)–onto→𝑡 → 𝑡 = ran 𝐺)
45	42, 44	syl 17	. . . . . 6 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → 𝑡 = ran 𝐺)
46	45	3adant2 1132	. . . . 5 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → 𝑡 = ran 𝐺)
47	46	pm4.71ri 560	. . . 4 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ (𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
48	47	exbii 1850	. . 3 ⊢ (∃𝑡(𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ ∃𝑡(𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
49	23, 48	bitrdi 287	. 2 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ GrpOp ↔ ∃𝑡(𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)))))
50		rnexg 7854	. . 3 ⊢ (𝐺 ∈ 𝐴 → ran 𝐺 ∈ V)
51		isgrp.1	. . . . . 6 ⊢ 𝑋 = ran 𝐺
52	51	eqeq2i 2750	. . . . 5 ⊢ (𝑡 = 𝑋 ↔ 𝑡 = ran 𝐺)
53		xpeq1 5646	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑡))
54		xpeq2 5653	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → (𝑋 × 𝑡) = (𝑋 × 𝑋))
55	53, 54	eqtrd 2772	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑋))
56	55	feq2d 6654	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (𝐺:(𝑡 × 𝑡)⟶𝑡 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑡))
57		feq3 6650	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (𝐺:(𝑋 × 𝑋)⟶𝑡 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑋))
58	56, 57	bitrd 279	. . . . . 6 ⊢ (𝑡 = 𝑋 → (𝐺:(𝑡 × 𝑡)⟶𝑡 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑋))
59		raleq 3295	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
60	59	raleqbi1dv 3310	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
61	60	raleqbi1dv 3310	. . . . . 6 ⊢ (𝑡 = 𝑋 → (∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
62		rexeq 3294	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → (∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
63	62	anbi2d 631	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ↔ ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
64	63	raleqbi1dv 3310	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
65	64	rexeqbi1dv 3311	. . . . . 6 ⊢ (𝑡 = 𝑋 → (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ↔ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
66	58, 61, 65	3anbi123d 1439	. . . . 5 ⊢ (𝑡 = 𝑋 → ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
67	52, 66	sylbir 235	. . . 4 ⊢ (𝑡 = ran 𝐺 → ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
68	67	ceqsexgv 3610	. . 3 ⊢ (ran 𝐺 ∈ V → (∃𝑡(𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
69	50, 68	syl 17	. 2 ⊢ (𝐺 ∈ 𝐴 → (∃𝑡(𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
70	49, 69	bitrd 279	1 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  Vcvv 3442   × cxp 5630  ran crn 5633  ⟶wf 6496  –onto→wfo 6498  (class class class)co 7368  GrpOpcgr 30576

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fo 6506  df-fv 6508  df-ov 7371  df-grpo 30580

This theorem is referenced by:  isgrpoi  30585  grpofo  30586  grpolidinv  30588  grpoass  30590  grpomndo  38120  isgrpda  38200