Theorem grpoidinv 30437

Description: A group has a left and right identity element, and every member has a left and right inverse. (Contributed by NM, 14-Oct-2006.) (New usage is discouraged.)

Hypothesis

Ref	Expression
grpfo.1	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
grpoidinv	⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))

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

Proof of Theorem grpoidinv

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 482	. . . . . . . 8 ⊢ (((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → (𝑢𝐺𝑧) = 𝑧)
2	1	ralimi 3066	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
3		oveq2 7395	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝑢𝐺𝑧) = (𝑢𝐺𝑥))
4		id 22	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → 𝑧 = 𝑥)
5	3, 4	eqeq12d 2745	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ((𝑢𝐺𝑧) = 𝑧 ↔ (𝑢𝐺𝑥) = 𝑥))
6	5	rspccva 3587	. . . . . . 7 ⊢ ((∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
7	2, 6	sylan 580	. . . . . 6 ⊢ ((∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
8	7	adantll 714	. . . . 5 ⊢ (((𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
9	8	adantll 714	. . . 4 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
10		simpl 482	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) → 𝐺 ∈ GrpOp)
11	10	anim1i 615	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋))
12		id 22	. . . . . . . . . 10 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) → (𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋))
13	12	adantrr 717	. . . . . . . . 9 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) → (𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋))
14	13	adantr 480	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋))
15	2	adantl 481	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) → ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
16	15	ad2antlr 727	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
17		simpr 484	. . . . . . . . . . 11 ⊢ (((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
18	17	ralimi 3066	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
19	18	adantl 481	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) → ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
20	19	ad2antlr 727	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
21	14, 16, 20	jca32 515	. . . . . . 7 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) ∧ (∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)))
22		grpfo.1	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
23		biid 261	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ↔ ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
24		biid 261	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢 ↔ ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
25	22, 23, 24	grpoidinvlem3 30435	. . . . . . 7 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) ∧ (∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))
26	21, 25	sylancom 588	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))
27	22	grpoidinvlem4 30436	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → (𝑥𝐺𝑢) = (𝑢𝐺𝑥))
28	11, 26, 27	syl2anc 584	. . . . 5 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝑥𝐺𝑢) = (𝑢𝐺𝑥))
29	28, 9	eqtrd 2764	. . . 4 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝑥𝐺𝑢) = 𝑥)
30	9, 29, 26	jca31 514	. . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
31	30	ralrimiva 3125	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) → ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
32	22	grpolidinv 30430	. 2 ⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))
33	31, 32	reximddv 3149	1 ⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053  ran crn 5639  (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-sep 5251  ax-nul 5261  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-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-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-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517  df-fv 6519  df-ov 7390  df-grpo 30422

This theorem is referenced by:  grpoideu  30438  grpoidval  30442  grpoidinv2  30444  grpomndo  37869