Theorem isgrpda 38707

Description: Obsolete theorem, use isgrpde 19085 instead. Properties that determine a group operation. (Contributed by Jeff Madsen, 1-Dec-2009.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
isgrpda.1	⊢ (𝜑 → 𝑋 ∈ V)
isgrpda.2	⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑋)
isgrpda.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
isgrpda.4	⊢ (𝜑 → 𝑈 ∈ 𝑋)
isgrpda.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑈𝐺𝑥) = 𝑥)
isgrpda.6	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑛 ∈ 𝑋 (𝑛𝐺𝑥) = 𝑈)

Assertion

Ref	Expression
isgrpda	⊢ (𝜑 → 𝐺 ∈ GrpOp)

Distinct variable groups:   𝜑,𝑥,𝑦,𝑧   𝑛,𝐺,𝑥,𝑦,𝑧   𝑛,𝑋,𝑥,𝑦,𝑧   𝑈,𝑛,𝑥,𝑦,𝑧

Allowed substitution hint:   𝜑(𝑛)

Proof of Theorem isgrpda

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isgrpda.2	. . 3 ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑋)
2		isgrpda.3	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
3	2	ralrimivvva 3210	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
4		isgrpda.4	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑋)
5		isgrpda.5	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑈𝐺𝑥) = 𝑥)
6		isgrpda.6	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑛 ∈ 𝑋 (𝑛𝐺𝑥) = 𝑈)
7		oveq1 7423	. . . . . . . . 9 ⊢ (𝑦 = 𝑛 → (𝑦𝐺𝑥) = (𝑛𝐺𝑥))
8	7	eqeq1d 2764	. . . . . . . 8 ⊢ (𝑦 = 𝑛 → ((𝑦𝐺𝑥) = 𝑈 ↔ (𝑛𝐺𝑥) = 𝑈))
9	8	cbvrexvw 3243	. . . . . . 7 ⊢ (∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈 ↔ ∃𝑛 ∈ 𝑋 (𝑛𝐺𝑥) = 𝑈)
10	6, 9	sylibr 237	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)
11	5, 10	jca 521	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
12	11	ralrimiva 3156	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
13		oveq1 7423	. . . . . . . 8 ⊢ (𝑢 = 𝑈 → (𝑢𝐺𝑥) = (𝑈𝐺𝑥))
14	13	eqeq1d 2764	. . . . . . 7 ⊢ (𝑢 = 𝑈 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑈𝐺𝑥) = 𝑥))
15		eqeq2 2774	. . . . . . . 8 ⊢ (𝑢 = 𝑈 → ((𝑦𝐺𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑈))
16	15	rexbidv 3188	. . . . . . 7 ⊢ (𝑢 = 𝑈 → (∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
17	14, 16	anbi12d 644	. . . . . 6 ⊢ (𝑢 = 𝑈 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
18	17	ralbidv 3187	. . . . 5 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
19	18	rspcev 3579	. . . 4 ⊢ ((𝑈 ∈ 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
20	4, 12, 19	syl2anc 596	. . 3 ⊢ (𝜑 → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
21	4	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑈 ∈ 𝑋)
22		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
23	5	eqcomd 2768	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 = (𝑈𝐺𝑥))
24		rspceov 7465	. . . . . . . . . 10 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑈𝐺𝑥)) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
25	21, 22, 23, 24	syl3anc 1398	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
26	25	ralrimiva 3156	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧))
27		foov 7591	. . . . . . . 8 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑋 ∃𝑧 ∈ 𝑋 𝑥 = (𝑦𝐺𝑧)))
28	1, 26, 27	sylanbrc 595	. . . . . . 7 ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)–onto→𝑋)
29		forn 6796	. . . . . . 7 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 → ran 𝐺 = 𝑋)
30	28, 29	syl 18	. . . . . 6 ⊢ (𝜑 → ran 𝐺 = 𝑋)
31	30	sqxpeqd 5691	. . . . 5 ⊢ (𝜑 → (ran 𝐺 × ran 𝐺) = (𝑋 × 𝑋))
32	31, 30	feq23d 6701	. . . 4 ⊢ (𝜑 → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ↔ 𝐺:(𝑋 × 𝑋)⟶𝑋))
33	30	raleqdv 3321	. . . . . 6 ⊢ (𝜑 → (∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
34	30, 33	raleqbidv 3336	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ ran 𝐺∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
35	30, 34	raleqbidv 3336	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
36	30	rexeqdv 3322	. . . . . . 7 ⊢ (𝜑 → (∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))
37	36	anbi2d 642	. . . . . 6 ⊢ (𝜑 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢) ↔ ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
38	30, 37	raleqbidv 3336	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
39	30, 38	rexeqbidv 3337	. . . 4 ⊢ (𝜑 → (∃𝑢 ∈ ran 𝐺∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢) ↔ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
40	32, 35, 39	3anbi123d 1464	. . 3 ⊢ (𝜑 → ((𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ ran 𝐺∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢)) ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
41	1, 3, 20, 40	mpbir3and 1361	. 2 ⊢ (𝜑 → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ ran 𝐺∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢)))
42		isgrpda.1	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ V)
43	42, 42	xpexd 7753	. . . 4 ⊢ (𝜑 → (𝑋 × 𝑋) ∈ V)
44	1, 43	fexd 7229	. . 3 ⊢ (𝜑 → 𝐺 ∈ V)
45		eqid 2762	. . . 4 ⊢ ran 𝐺 = ran 𝐺
46	45	isgrpo 30979	. . 3 ⊢ (𝐺 ∈ V → (𝐺 ∈ GrpOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ ran 𝐺∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢))))
47	44, 46	syl 18	. 2 ⊢ (𝜑 → (𝐺 ∈ GrpOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺∀𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ ran 𝐺∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑢))))
48	41, 47	mpbird 260	1 ⊢ (𝜑 → 𝐺 ∈ GrpOp)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088  Vcvv 3453   × cxp 5657  ran crn 5660  ⟶wf 6533  –onto→wfo 6535  (class class class)co 7416  GrpOpcgr 30971

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-grpo 30975

This theorem is used by:  isdrngo2  38710