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

Theorem grpoidinv2 28877
Description: A group's properties using the explicit identity element. (Contributed by NM, 5-Feb-2010.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpoidval.1 𝑋 = ran 𝐺
grpoidval.2 𝑈 = (GId‘𝐺)
Assertion
Ref Expression
grpoidinv2 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋) → (((𝑈𝐺𝐴) = 𝐴 ∧ (𝐴𝐺𝑈) = 𝐴) ∧ ∃𝑦𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
Distinct variable groups:   𝑦,𝐴   𝑦,𝐺   𝑦,𝑈   𝑦,𝑋

Proof of Theorem grpoidinv2
Dummy variables 𝑥 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpoidval.1 . . . . . . 7 𝑋 = ran 𝐺
2 grpoidval.2 . . . . . . 7 𝑈 = (GId‘𝐺)
31, 2grpoidval 28875 . . . . . 6 (𝐺 ∈ GrpOp → 𝑈 = (𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
41grpoideu 28871 . . . . . . 7 (𝐺 ∈ GrpOp → ∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥)
5 riotacl2 7249 . . . . . . 7 (∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥 → (𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∈ {𝑢𝑋 ∣ ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥})
64, 5syl 17 . . . . . 6 (𝐺 ∈ GrpOp → (𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∈ {𝑢𝑋 ∣ ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥})
73, 6eqeltrd 2839 . . . . 5 (𝐺 ∈ GrpOp → 𝑈 ∈ {𝑢𝑋 ∣ ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥})
8 simpll 764 . . . . . . . . . . 11 ((((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → (𝑢𝐺𝑥) = 𝑥)
98ralimi 3087 . . . . . . . . . 10 (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥)
109rgenw 3076 . . . . . . . . 9 𝑢𝑋 (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥)
1110a1i 11 . . . . . . . 8 (𝐺 ∈ GrpOp → ∀𝑢𝑋 (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
121grpoidinv 28870 . . . . . . . 8 (𝐺 ∈ GrpOp → ∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
1311, 12, 43jca 1127 . . . . . . 7 (𝐺 ∈ GrpOp → (∀𝑢𝑋 (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ ∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) ∧ ∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥))
14 reupick2 4254 . . . . . . 7 (((∀𝑢𝑋 (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ ∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) ∧ ∃!𝑢𝑋𝑥𝑋 (𝑢𝐺𝑥) = 𝑥) ∧ 𝑢𝑋) → (∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥 ↔ ∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))))
1513, 14sylan 580 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑢𝑋) → (∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥 ↔ ∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))))
1615rabbidva 3413 . . . . 5 (𝐺 ∈ GrpOp → {𝑢𝑋 ∣ ∀𝑥𝑋 (𝑢𝐺𝑥) = 𝑥} = {𝑢𝑋 ∣ ∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))})
177, 16eleqtrd 2841 . . . 4 (𝐺 ∈ GrpOp → 𝑈 ∈ {𝑢𝑋 ∣ ∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))})
18 oveq1 7282 . . . . . . . . 9 (𝑢 = 𝑈 → (𝑢𝐺𝑥) = (𝑈𝐺𝑥))
1918eqeq1d 2740 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑈𝐺𝑥) = 𝑥))
20 oveq2 7283 . . . . . . . . 9 (𝑢 = 𝑈 → (𝑥𝐺𝑢) = (𝑥𝐺𝑈))
2120eqeq1d 2740 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑥𝐺𝑢) = 𝑥 ↔ (𝑥𝐺𝑈) = 𝑥))
2219, 21anbi12d 631 . . . . . . 7 (𝑢 = 𝑈 → (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥)))
23 eqeq2 2750 . . . . . . . . 9 (𝑢 = 𝑈 → ((𝑦𝐺𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑈))
24 eqeq2 2750 . . . . . . . . 9 (𝑢 = 𝑈 → ((𝑥𝐺𝑦) = 𝑢 ↔ (𝑥𝐺𝑦) = 𝑈))
2523, 24anbi12d 631 . . . . . . . 8 (𝑢 = 𝑈 → (((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢) ↔ ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈)))
2625rexbidv 3226 . . . . . . 7 (𝑢 = 𝑈 → (∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢) ↔ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈)))
2722, 26anbi12d 631 . . . . . 6 (𝑢 = 𝑈 → ((((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) ↔ (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈))))
2827ralbidv 3112 . . . . 5 (𝑢 = 𝑈 → (∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) ↔ ∀𝑥𝑋 (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈))))
2928elrab 3624 . . . 4 (𝑈 ∈ {𝑢𝑋 ∣ ∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))} ↔ (𝑈𝑋 ∧ ∀𝑥𝑋 (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈))))
3017, 29sylib 217 . . 3 (𝐺 ∈ GrpOp → (𝑈𝑋 ∧ ∀𝑥𝑋 (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈))))
3130simprd 496 . 2 (𝐺 ∈ GrpOp → ∀𝑥𝑋 (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈)))
32 oveq2 7283 . . . . . 6 (𝑥 = 𝐴 → (𝑈𝐺𝑥) = (𝑈𝐺𝐴))
33 id 22 . . . . . 6 (𝑥 = 𝐴𝑥 = 𝐴)
3432, 33eqeq12d 2754 . . . . 5 (𝑥 = 𝐴 → ((𝑈𝐺𝑥) = 𝑥 ↔ (𝑈𝐺𝐴) = 𝐴))
35 oveq1 7282 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐺𝑈) = (𝐴𝐺𝑈))
3635, 33eqeq12d 2754 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐺𝑈) = 𝑥 ↔ (𝐴𝐺𝑈) = 𝐴))
3734, 36anbi12d 631 . . . 4 (𝑥 = 𝐴 → (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ↔ ((𝑈𝐺𝐴) = 𝐴 ∧ (𝐴𝐺𝑈) = 𝐴)))
38 oveq2 7283 . . . . . . 7 (𝑥 = 𝐴 → (𝑦𝐺𝑥) = (𝑦𝐺𝐴))
3938eqeq1d 2740 . . . . . 6 (𝑥 = 𝐴 → ((𝑦𝐺𝑥) = 𝑈 ↔ (𝑦𝐺𝐴) = 𝑈))
40 oveq1 7282 . . . . . . 7 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
4140eqeq1d 2740 . . . . . 6 (𝑥 = 𝐴 → ((𝑥𝐺𝑦) = 𝑈 ↔ (𝐴𝐺𝑦) = 𝑈))
4239, 41anbi12d 631 . . . . 5 (𝑥 = 𝐴 → (((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈) ↔ ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
4342rexbidv 3226 . . . 4 (𝑥 = 𝐴 → (∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈) ↔ ∃𝑦𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
4437, 43anbi12d 631 . . 3 (𝑥 = 𝐴 → ((((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈)) ↔ (((𝑈𝐺𝐴) = 𝐴 ∧ (𝐴𝐺𝑈) = 𝐴) ∧ ∃𝑦𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈))))
4544rspccva 3560 . 2 ((∀𝑥𝑋 (((𝑈𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑈) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑈 ∧ (𝑥𝐺𝑦) = 𝑈)) ∧ 𝐴𝑋) → (((𝑈𝐺𝐴) = 𝐴 ∧ (𝐴𝐺𝑈) = 𝐴) ∧ ∃𝑦𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
4631, 45sylan 580 1 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋) → (((𝑈𝐺𝐴) = 𝐴 ∧ (𝐴𝐺𝑈) = 𝐴) ∧ ∃𝑦𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1539  wcel 2106  wral 3064  wrex 3065  ∃!wreu 3066  {crab 3068  ran crn 5590  cfv 6433  crio 7231  (class class class)co 7275  GrpOpcgr 28851  GIdcgi 28852
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fo 6439  df-fv 6441  df-riota 7232  df-ov 7278  df-grpo 28855  df-gid 28856
This theorem is referenced by:  grpolid  28878  grporid  28879  grporcan  28880  grpoinveu  28881  grpoinv  28887
  Copyright terms: Public domain W3C validator