Theorem grpoidinv 30797

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 487	. . . . . . . 8 ⊢ (((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → (𝑢𝐺𝑧) = 𝑧)
2	1	ralimi 3108	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
3		oveq2 7416	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝑢𝐺𝑧) = (𝑢𝐺𝑥))
4		id 23	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → 𝑧 = 𝑥)
5	3, 4	eqeq12d 2785	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ((𝑢𝐺𝑧) = 𝑧 ↔ (𝑢𝐺𝑥) = 𝑥))
6	5	rspccva 3589	. . . . . . 7 ⊢ ((∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
7	2, 6	sylan 591	. . . . . 6 ⊢ ((∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
8	7	adantll 726	. . . . 5 ⊢ (((𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
9	8	adantll 726	. . . 4 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝑢𝐺𝑥) = 𝑥)
10		simpl 487	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) → 𝐺 ∈ GrpOp)
11	10	anim1i 626	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋))
12		id 23	. . . . . . . . . 10 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) → (𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋))
13	12	adantrr 729	. . . . . . . . 9 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) → (𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋))
14	13	adantr 485	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋))
15	2	adantl 486	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) → ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
16	15	ad2antlr 739	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
17		simpr 489	. . . . . . . . . . 11 ⊢ (((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
18	17	ralimi 3108	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢) → ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
19	18	adantl 486	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) → ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
20	19	ad2antlr 739	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
21	14, 16, 20	jca32 524	. . . . . . 7 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) ∧ (∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)))
22		grpfo.1	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
23		biid 264	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ↔ ∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧)
24		biid 264	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢 ↔ ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)
25	22, 23, 24	grpoidinvlem3 30795	. . . . . . 7 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) ∧ (∀𝑧 ∈ 𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ ∀𝑧 ∈ 𝑋 ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢)) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))
26	21, 25	sylancom 599	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))
27	22	grpoidinvlem4 30796	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → (𝑥𝐺𝑢) = (𝑢𝐺𝑥))
28	11, 26, 27	syl2anc 595	. . . . 5 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝑥𝐺𝑢) = (𝑢𝐺𝑥))
29	28, 9	eqtrd 2804	. . . 4 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (𝑥𝐺𝑢) = 𝑥)
30	9, 29, 26	jca31 523	. . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥 ∈ 𝑋) → (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
31	30	ralrimiva 3163	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑢 ∈ 𝑋 ∧ ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))) → ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
32	22	grpolidinv 30790	. 2 ⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤 ∈ 𝑋 (𝑤𝐺𝑧) = 𝑢))
33	31, 32	reximddv 3187	1 ⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085  ∃wrex 3095  ran crn 5660  (class class class)co 7408  GrpOpcgr 30778

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-ov 7411  df-grpo 30782

This theorem is referenced by:  grpoideu  30798  grpoidval  30802  grpoidinv2  30804  grpomndo  38409