MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpoidval Structured version   Visualization version   GIF version

Theorem grpoidval 27940
Description: Lemma for grpoidcl 27941 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.
StepHypRef Expression
1 grpoidval.2 . 2 𝑈 = (GId‘𝐺)
2 grpoidval.1 . . . 4 𝑋 = ran 𝐺
32gidval 27939 . . 3 (𝐺 ∈ GrpOp → (GId‘𝐺) = (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
4 simpl 476 . . . . . . . . 9 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → (𝑢𝐺𝑥) = 𝑥)
54ralimi 3134 . . . . . . . 8 (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥)
65rgenw 3106 . . . . . . 7 𝑢𝑋 (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥)
76a1i 11 . . . . . 6 (𝐺 ∈ GrpOp → ∀𝑢𝑋 (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
82grpoidinv 27935 . . . . . . 7 (𝐺 ∈ GrpOp → ∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
9 simpl 476 . . . . . . . . 9 ((((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
109ralimi 3134 . . . . . . . 8 (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
1110reximi 3192 . . . . . . 7 (∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
128, 11syl 17 . . . . . 6 (𝐺 ∈ GrpOp → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
132grpoideu 27936 . . . . . 6 (𝐺 ∈ GrpOp → ∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥)
147, 12, 133jca 1119 . . . . 5 (𝐺 ∈ GrpOp → (∀𝑢𝑋 (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
15 reupick2 4139 . . . . 5 (((∀𝑢𝑋 (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ 𝑢𝑋) → (∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥 ↔ ∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1614, 15sylan 575 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝑢𝑋) → (∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥 ↔ ∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1716riotabidva 6899 . . 3 (𝐺 ∈ GrpOp → (𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) = (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
183, 17eqtr4d 2817 . 2 (𝐺 ∈ GrpOp → (GId‘𝐺) = (𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
191, 18syl5eq 2826 1 (𝐺 ∈ GrpOp → 𝑈 = (𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 386  w3a 1071   = wceq 1601  wcel 2107  wral 3090  wrex 3091  ∃!wreu 3092  ran crn 5356  cfv 6135  crio 6882  (class class class)co 6922  GrpOpcgr 27916  GIdcgi 27917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5017  ax-nul 5025  ax-pr 5138  ax-un 7226
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4672  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-id 5261  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-fo 6141  df-fv 6143  df-riota 6883  df-ov 6925  df-grpo 27920  df-gid 27921
This theorem is referenced by:  grpoidcl  27941  grpoidinv2  27942  cnidOLD  28009  hilid  28590
  Copyright terms: Public domain W3C validator