Theorem isgrpoi 30427

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 3182	. 2 ⊢ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))
4		isgrpoi.4	. . 3 ⊢ 𝑈 ∈ 𝑋
5		isgrpoi.5	. . . . 5 ⊢ (𝑥 ∈ 𝑋 → (𝑈𝐺𝑥) = 𝑥)
6		isgrpoi.6	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → 𝑁 ∈ 𝑋)
7		isgrpoi.7	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (𝑁𝐺𝑥) = 𝑈)
8		oveq1 7394	. . . . . . . 8 ⊢ (𝑦 = 𝑁 → (𝑦𝐺𝑥) = (𝑁𝐺𝑥))
9	8	eqeq1d 2731	. . . . . . 7 ⊢ (𝑦 = 𝑁 → ((𝑦𝐺𝑥) = 𝑈 ↔ (𝑁𝐺𝑥) = 𝑈))
10	9	rspcev 3588	. . . . . 6 ⊢ ((𝑁 ∈ 𝑋 ∧ (𝑁𝐺𝑥) = 𝑈) → ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
11	6, 7, 10	syl2anc 584	. . . . 5 ⊢ (𝑥 ∈ 𝑋 → ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
12	5, 11	jca 511	. . . 4 ⊢ (𝑥 ∈ 𝑋 → ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
13	12	rgen 3046	. . 3 ⊢ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
14		oveq1 7394	. . . . . . 7 ⊢ (𝑢 = 𝑈 → (𝑢𝐺𝑥) = (𝑈𝐺𝑥))
15	14	eqeq1d 2731	. . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑈𝐺𝑥) = 𝑥))
16		eqeq2 2741	. . . . . . 7 ⊢ (𝑢 = 𝑈 → ((𝑦𝐺𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑈))
17	16	rexbidv 3157	. . . . . 6 ⊢ (𝑢 = 𝑈 → (∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
18	15, 17	anbi12d 632	. . . . 5 ⊢ (𝑢 = 𝑈 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
19	18	ralbidv 3156	. . . 4 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
20	19	rspcev 3588	. . 3 ⊢ ((𝑈 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
21	4, 13, 20	mp2an 692	. 2 ⊢ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)
22		isgrpoi.1	. . . . 5 ⊢ 𝑋 ∈ V
23	22, 22	xpex 7729	. . . 4 ⊢ (𝑋 × 𝑋) ∈ V
24		fex 7200	. . . 4 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ (𝑋 × 𝑋) ∈ V) → 𝐺 ∈ V)
25	1, 23, 24	mp2an 692	. . 3 ⊢ 𝐺 ∈ V
26	5	eqcomd 2735	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → 𝑥 = (𝑈𝐺𝑥))
27		rspceov 7436	. . . . . . . . . 10 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑈𝐺𝑥)) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
28	4, 27	mp3an1 1450	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑈𝐺𝑥)) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
29	26, 28	mpdan 687	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
30	29	rgen 3046	. . . . . . 7 ⊢ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧)
31		foov 7563	. . . . . . 7 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧)))
32	1, 30, 31	mpbir2an 711	. . . . . 6 ⊢ 𝐺:(𝑋 × 𝑋)–onto→𝑋
33		forn 6775	. . . . . 6 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 → ran 𝐺 = 𝑋)
34	32, 33	ax-mp 5	. . . . 5 ⊢ ran 𝐺 = 𝑋
35	34	eqcomi 2738	. . . 4 ⊢ 𝑋 = ran 𝐺
36	35	isgrpo 30426	. . 3 ⊢ (𝐺 ∈ V → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
37	25, 36	ax-mp 5	. 2 ⊢ (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
38	1, 3, 21, 37	mpbir3an 1342	1 ⊢ 𝐺 ∈ GrpOp

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053  Vcvv 3447   × cxp 5636  ran crn 5639  ⟶wf 6507  –onto→wfo 6509  (class class class)co 7387  GrpOpcgr 30418

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 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-grpo 30422

This theorem is referenced by:  cnaddabloOLD  30510  hilablo  31089  hhssabloilem  31190  grposnOLD  37876