Theorem isgrpoi 30586

Description: Properties that determine a group operation. Read 𝑁 as 𝑁(𝑥). (Contributed by NM, 4-Nov-2006.) (New usage is discouraged.)

Hypotheses

Ref	Expression
isgrpoi.1	⊢ 𝑋 ∈ V
isgrpoi.2	⊢ 𝐺:(𝑋 × 𝑋)⟶𝑋
isgrpoi.3	⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
isgrpoi.4	⊢ 𝑈 ∈ 𝑋
isgrpoi.5	⊢ (𝑥 ∈ 𝑋 → (𝑈𝐺𝑥) = 𝑥)
isgrpoi.6	⊢ (𝑥 ∈ 𝑋 → 𝑁 ∈ 𝑋)
isgrpoi.7	⊢ (𝑥 ∈ 𝑋 → (𝑁𝐺𝑥) = 𝑈)

Assertion

Ref	Expression
isgrpoi	⊢ 𝐺 ∈ GrpOp

Distinct variable groups:   𝑥,𝑦,𝑧,𝐺   𝑥,𝑈,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑦,𝑁

Allowed substitution hints:   𝑁(𝑥,𝑧)

Proof of Theorem isgrpoi

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isgrpoi.2	. 2 ⊢ 𝐺:(𝑋 × 𝑋)⟶𝑋
2		isgrpoi.3	. . 3 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
3	2	rgen3 3183	. 2 ⊢ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))
4		isgrpoi.4	. . 3 ⊢ 𝑈 ∈ 𝑋
5		isgrpoi.5	. . . . 5 ⊢ (𝑥 ∈ 𝑋 → (𝑈𝐺𝑥) = 𝑥)
6		isgrpoi.6	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → 𝑁 ∈ 𝑋)
7		isgrpoi.7	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (𝑁𝐺𝑥) = 𝑈)
8		oveq1 7375	. . . . . . . 8 ⊢ (𝑦 = 𝑁 → (𝑦𝐺𝑥) = (𝑁𝐺𝑥))
9	8	eqeq1d 2739	. . . . . . 7 ⊢ (𝑦 = 𝑁 → ((𝑦𝐺𝑥) = 𝑈 ↔ (𝑁𝐺𝑥) = 𝑈))
10	9	rspcev 3578	. . . . . 6 ⊢ ((𝑁 ∈ 𝑋 ∧ (𝑁𝐺𝑥) = 𝑈) → ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
11	6, 7, 10	syl2anc 585	. . . . 5 ⊢ (𝑥 ∈ 𝑋 → ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
12	5, 11	jca 511	. . . 4 ⊢ (𝑥 ∈ 𝑋 → ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
13	12	rgen 3054	. . 3 ⊢ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
14		oveq1 7375	. . . . . . 7 ⊢ (𝑢 = 𝑈 → (𝑢𝐺𝑥) = (𝑈𝐺𝑥))
15	14	eqeq1d 2739	. . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑈𝐺𝑥) = 𝑥))
16		eqeq2 2749	. . . . . . 7 ⊢ (𝑢 = 𝑈 → ((𝑦𝐺𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑈))
17	16	rexbidv 3162	. . . . . 6 ⊢ (𝑢 = 𝑈 → (∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
18	15, 17	anbi12d 633	. . . . 5 ⊢ (𝑢 = 𝑈 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
19	18	ralbidv 3161	. . . 4 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
20	19	rspcev 3578	. . 3 ⊢ ((𝑈 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
21	4, 13, 20	mp2an 693	. 2 ⊢ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)
22		isgrpoi.1	. . . . 5 ⊢ 𝑋 ∈ V
23	22, 22	xpex 7708	. . . 4 ⊢ (𝑋 × 𝑋) ∈ V
24		fex 7182	. . . 4 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ (𝑋 × 𝑋) ∈ V) → 𝐺 ∈ V)
25	1, 23, 24	mp2an 693	. . 3 ⊢ 𝐺 ∈ V
26	5	eqcomd 2743	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → 𝑥 = (𝑈𝐺𝑥))
27		rspceov 7417	. . . . . . . . . 10 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑈𝐺𝑥)) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
28	4, 27	mp3an1 1451	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑈𝐺𝑥)) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
29	26, 28	mpdan 688	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
30	29	rgen 3054	. . . . . . 7 ⊢ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧)
31		foov 7542	. . . . . . 7 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧)))
32	1, 30, 31	mpbir2an 712	. . . . . 6 ⊢ 𝐺:(𝑋 × 𝑋)–onto→𝑋
33		forn 6757	. . . . . 6 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 → ran 𝐺 = 𝑋)
34	32, 33	ax-mp 5	. . . . 5 ⊢ ran 𝐺 = 𝑋
35	34	eqcomi 2746	. . . 4 ⊢ 𝑋 = ran 𝐺
36	35	isgrpo 30585	. . 3 ⊢ (𝐺 ∈ V → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
37	25, 36	ax-mp 5	. 2 ⊢ (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
38	1, 3, 21, 37	mpbir3an 1343	1 ⊢ 𝐺 ∈ GrpOp

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

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-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  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-reu 3353  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-pw 4558  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-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-grpo 30581

This theorem is referenced by:  cnaddabloOLD  30669  hilablo  31248  hhssabloilem  31349  grposnOLD  38133