Theorem isgrpo 30433

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 6669	. . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔:(𝑡 × 𝑡)⟶𝑡 ↔ 𝐺:(𝑡 × 𝑡)⟶𝑡))
2		oveq 7396	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((𝑥𝑔𝑦)𝑔𝑧) = ((𝑥𝑔𝑦)𝐺𝑧))
3		oveq 7396	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
4	3	oveq1d 7405	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((𝑥𝑔𝑦)𝐺𝑧) = ((𝑥𝐺𝑦)𝐺𝑧))
5	2, 4	eqtrd 2765	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ((𝑥𝑔𝑦)𝑔𝑧) = ((𝑥𝐺𝑦)𝐺𝑧))
6		oveq 7396	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑥𝑔(𝑦𝑔𝑧)) = (𝑥𝐺(𝑦𝑔𝑧)))
7		oveq 7396	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑧) = (𝑦𝐺𝑧))
8	7	oveq2d 7406	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑥𝐺(𝑦𝑔𝑧)) = (𝑥𝐺(𝑦𝐺𝑧)))
9	6, 8	eqtrd 2765	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑥𝑔(𝑦𝑔𝑧)) = (𝑥𝐺(𝑦𝐺𝑧)))
10	5, 9	eqeq12d 2746	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ↔ ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
11	10	ralbidv 3157	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ↔ ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
12	11	2ralbidv 3202	. . . . . 6 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ↔ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
13		oveq 7396	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑢𝑔𝑥) = (𝑢𝐺𝑥))
14	13	eqeq1d 2732	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((𝑢𝑔𝑥) = 𝑥 ↔ (𝑢𝐺𝑥) = 𝑥))
15		oveq 7396	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥))
16	15	eqeq1d 2732	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑢))
17	16	rexbidv 3158	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))
18	14, 17	anbi12d 632	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢) ↔ ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)))
19	18	rexralbidv 3204	. . . . . 6 ⊢ (𝑔 = 𝐺 → (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢) ↔ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)))
20	1, 12, 19	3anbi123d 1438	. . . . 5 ⊢ (𝑔 = 𝐺 → ((𝑔:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢)) ↔ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
21	20	exbidv 1921	. . . 4 ⊢ (𝑔 = 𝐺 → (∃𝑡(𝑔:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢)) ↔ ∃𝑡(𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
22		df-grpo 30429	. . . 4 ⊢ GrpOp = {𝑔 ∣ ∃𝑡(𝑔:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝑔𝑦)𝑔𝑧) = (𝑥𝑔(𝑦𝑔𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝑔𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝑔𝑥) = 𝑢))}
23	21, 22	elab2g 3650	. . 3 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ GrpOp ↔ ∃𝑡(𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
24		simpl 482	. . . . . . . . . . . . . 14 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → (𝑢𝐺𝑥) = 𝑥)
25	24	ralimi 3067	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∀𝑥 ∈ 𝑡 (𝑢𝐺𝑥) = 𝑥)
26		oveq2 7398	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → (𝑢𝐺𝑥) = (𝑢𝐺𝑧))
27		id 22	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
28	26, 27	eqeq12d 2746	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑢𝐺𝑧) = 𝑧))
29		eqcom 2737	. . . . . . . . . . . . . . . 16 ⊢ ((𝑢𝐺𝑧) = 𝑧 ↔ 𝑧 = (𝑢𝐺𝑧))
30	28, 29	bitrdi 287	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → ((𝑢𝐺𝑥) = 𝑥 ↔ 𝑧 = (𝑢𝐺𝑧)))
31	30	rspcv 3587	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝑡 → (∀𝑥 ∈ 𝑡 (𝑢𝐺𝑥) = 𝑥 → 𝑧 = (𝑢𝐺𝑧)))
32		oveq2 7398	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑧 → (𝑢𝐺𝑦) = (𝑢𝐺𝑧))
33	32	rspceeqv 3614	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝑡 ∧ 𝑧 = (𝑢𝐺𝑧)) → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦))
34	33	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝑡 → (𝑧 = (𝑢𝐺𝑧) → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
35	31, 34	syld 47	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑡 → (∀𝑥 ∈ 𝑡 (𝑢𝐺𝑥) = 𝑥 → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
36	25, 35	syl5 34	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑡 → (∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
37	36	reximdv 3149	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑡 → (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
38	37	impcom 407	. . . . . . . . . 10 ⊢ ((∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ∧ 𝑧 ∈ 𝑡) → ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦))
39	38	ralrimiva 3126	. . . . . . . . 9 ⊢ (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) → ∀𝑧 ∈ 𝑡 ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦))
40	39	anim2i 617	. . . . . . . 8 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑧 ∈ 𝑡 ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
41		foov 7566	. . . . . . . 8 ⊢ (𝐺:(𝑡 × 𝑡)–onto→𝑡 ↔ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑧 ∈ 𝑡 ∃𝑢 ∈ 𝑡 ∃𝑦 ∈ 𝑡 𝑧 = (𝑢𝐺𝑦)))
42	40, 41	sylibr 234	. . . . . . 7 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → 𝐺:(𝑡 × 𝑡)–onto→𝑡)
43		forn 6778	. . . . . . . 8 ⊢ (𝐺:(𝑡 × 𝑡)–onto→𝑡 → ran 𝐺 = 𝑡)
44	43	eqcomd 2736	. . . . . . 7 ⊢ (𝐺:(𝑡 × 𝑡)–onto→𝑡 → 𝑡 = ran 𝐺)
45	42, 44	syl 17	. . . . . 6 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → 𝑡 = ran 𝐺)
46	45	3adant2 1131	. . . . 5 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) → 𝑡 = ran 𝐺)
47	46	pm4.71ri 560	. . . 4 ⊢ ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ (𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
48	47	exbii 1848	. . 3 ⊢ (∃𝑡(𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ ∃𝑡(𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢))))
49	23, 48	bitrdi 287	. 2 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ GrpOp ↔ ∃𝑡(𝑡 = ran 𝐺 ∧ (𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)))))
50		rnexg 7881	. . 3 ⊢ (𝐺 ∈ 𝐴 → ran 𝐺 ∈ V)
51		isgrp.1	. . . . . 6 ⊢ 𝑋 = ran 𝐺
52	51	eqeq2i 2743	. . . . 5 ⊢ (𝑡 = 𝑋 ↔ 𝑡 = ran 𝐺)
53		xpeq1 5655	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑡))
54		xpeq2 5662	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → (𝑋 × 𝑡) = (𝑋 × 𝑋))
55	53, 54	eqtrd 2765	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑋))
56	55	feq2d 6675	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (𝐺:(𝑡 × 𝑡)⟶𝑡 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑡))
57		feq3 6671	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (𝐺:(𝑋 × 𝑋)⟶𝑡 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑋))
58	56, 57	bitrd 279	. . . . . 6 ⊢ (𝑡 = 𝑋 → (𝐺:(𝑡 × 𝑡)⟶𝑡 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑋))
59		raleq 3298	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
60	59	raleqbi1dv 3313	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
61	60	raleqbi1dv 3313	. . . . . 6 ⊢ (𝑡 = 𝑋 → (∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
62		rexeq 3297	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → (∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
63	62	anbi2d 630	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ↔ ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
64	63	raleqbi1dv 3313	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
65	64	rexeqbi1dv 3314	. . . . . 6 ⊢ (𝑡 = 𝑋 → (∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢) ↔ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
66	58, 61, 65	3anbi123d 1438	. . . . 5 ⊢ (𝑡 = 𝑋 → ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
67	52, 66	sylbir 235	. . . 4 ⊢ (𝑡 = ran 𝐺 → ((𝐺:(𝑡 × 𝑡)⟶𝑡 ∧ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 ∀𝑧 ∈ 𝑡 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑡 ∀𝑥 ∈ 𝑡 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑡 (𝑦𝐺𝑥) = 𝑢)) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
68	67	ceqsexgv 3623	. . 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 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054  Vcvv 3450   × cxp 5639  ran crn 5642  ⟶wf 6510  –onto→wfo 6512  (class class class)co 7390  GrpOpcgr 30425

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fo 6520  df-fv 6522  df-ov 7393  df-grpo 30429

This theorem is referenced by:  isgrpoi  30434  grpofo  30435  grpolidinv  30437  grpoass  30439  grpomndo  37876  isgrpda  37956