Theorem grpoidval 28776

Description: Lemma for grpoidcl 28777 and others. (Contributed by NM, 5-Feb-2010.) (Proof shortened by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
grpoidval.1	⊢ 𝑋 = ran 𝐺
grpoidval.2	⊢ 𝑈 = (GId‘𝐺)

Assertion

Ref	Expression
grpoidval	⊢ (𝐺 ∈ GrpOp → 𝑈 = (℩𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥))

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

Proof of Theorem grpoidval

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpoidval.2	. 2 ⊢ 𝑈 = (GId‘𝐺)
2		grpoidval.1	. . . 4 ⊢ 𝑋 = ran 𝐺
3	2	gidval 28775	. . 3 ⊢ (𝐺 ∈ GrpOp → (GId‘𝐺) = (℩𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
4		simpl 482	. . . . . . . . 9 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → (𝑢𝐺𝑥) = 𝑥)
5	4	ralimi 3086	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥)
6	5	rgenw 3075	. . . . . . 7 ⊢ ∀𝑢 ∈ 𝑋 (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥)
7	6	a1i 11	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → ∀𝑢 ∈ 𝑋 (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥))
8	2	grpoidinv 28771	. . . . . . 7 ⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
9		simpl 482	. . . . . . . . 9 ⊢ ((((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
10	9	ralimi 3086	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
11	10	reximi 3174	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
12	8, 11	syl 17	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
13	2	grpoideu 28772	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → ∃!𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥)
14	7, 12, 13	3jca 1126	. . . . 5 ⊢ (𝐺 ∈ GrpOp → (∀𝑢 ∈ 𝑋 (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃!𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥))
15		reupick2 4251	. . . . 5 ⊢ (((∀𝑢 ∈ 𝑋 (∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃!𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ 𝑢 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥 ↔ ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
16	14, 15	sylan 579	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑢 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥 ↔ ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
17	16	riotabidva 7232	. . 3 ⊢ (𝐺 ∈ GrpOp → (℩𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥) = (℩𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
18	3, 17	eqtr4d 2781	. 2 ⊢ (𝐺 ∈ GrpOp → (GId‘𝐺) = (℩𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥))
19	1, 18	syl5eq 2791	1 ⊢ (𝐺 ∈ GrpOp → 𝑈 = (℩𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 (𝑢𝐺𝑥) = 𝑥))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  ∃!wreu 3065  ran crn 5581  ‘cfv 6418  ℩crio 7211  (class class class)co 7255  GrpOpcgr 28752  GIdcgi 28753

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fo 6424  df-fv 6426  df-riota 7212  df-ov 7258  df-grpo 28756  df-gid 28757

This theorem is referenced by:  grpoidcl  28777  grpoidinv2  28778  cnidOLD  28845  hilid  29424