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

Theorem grpoinv 31127
Description: The properties of a group element's inverse. (Contributed by NM, 27-Oct-2006.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpinv.1 𝑋 = ran 𝐺
grpinv.2 𝑈 = (GId‘𝐺)
grpinv.3 𝑁 = (inv‘𝐺)
Assertion
Ref Expression
grpoinv ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (((𝑁‘𝐴)𝐺𝐴) = 𝑈 ∧ (𝐴𝐺(𝑁‘𝐴)) = 𝑈))

Proof of Theorem grpoinv
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 grpinv.1 . . . . . 6 𝑋 = ran 𝐺
2 grpinv.2 . . . . . 6 𝑈 = (GId‘𝐺)
3 grpinv.3 . . . . . 6 𝑁 = (inv‘𝐺)
41, 2, 3grpoinvval 31125 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈))
51, 2grpoinveu 31121 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ∃!𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈)
6 riotacl2 7393 . . . . . 6 (∃!𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈 → (℩𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈) ∈ {𝑦 ∈ 𝑋 ∣ (𝑦𝐺𝐴) = 𝑈})
75, 6syl 18 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (℩𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈) ∈ {𝑦 ∈ 𝑋 ∣ (𝑦𝐺𝐴) = 𝑈})
84, 7eqeltrd 2861 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ {𝑦 ∈ 𝑋 ∣ (𝑦𝐺𝐴) = 𝑈})
9 simpl 488 . . . . . . . . 9 (((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) → (𝑦𝐺𝐴) = 𝑈)
109rgenw 3081 . . . . . . . 8 ∀𝑦 ∈ 𝑋 (((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) → (𝑦𝐺𝐴) = 𝑈)
1110a1i 11 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ∀𝑦 ∈ 𝑋 (((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) → (𝑦𝐺𝐴) = 𝑈))
121, 2grpoidinv2 31117 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (((𝑈𝐺𝐴) = 𝐴 ∧ (𝐴𝐺𝑈) = 𝐴) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
1312simprd 501 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈))
1411, 13, 53jca 1146 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (∀𝑦 ∈ 𝑋 (((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) → (𝑦𝐺𝐴) = 𝑈) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) ∧ ∃!𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈))
15 reupick2 4277 . . . . . 6 (((∀𝑦 ∈ 𝑋 (((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) → (𝑦𝐺𝐴) = 𝑈) ∧ ∃𝑦 ∈ 𝑋 ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) ∧ ∃!𝑦 ∈ 𝑋 (𝑦𝐺𝐴) = 𝑈) ∧ 𝑦 ∈ 𝑋) → ((𝑦𝐺𝐴) = 𝑈 ↔ ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
1614, 15sylan 592 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝑦𝐺𝐴) = 𝑈 ↔ ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)))
1716rabbidva 3419 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → {𝑦 ∈ 𝑋 ∣ (𝑦𝐺𝐴) = 𝑈} = {𝑦 ∈ 𝑋 ∣ ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)})
188, 17eleqtrd 2863 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ {𝑦 ∈ 𝑋 ∣ ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)})
19 oveq1 7427 . . . . . 6 (𝑦 = (𝑁‘𝐴) → (𝑦𝐺𝐴) = ((𝑁‘𝐴)𝐺𝐴))
2019eqeq1d 2763 . . . . 5 (𝑦 = (𝑁‘𝐴) → ((𝑦𝐺𝐴) = 𝑈 ↔ ((𝑁‘𝐴)𝐺𝐴) = 𝑈))
21 oveq2 7428 . . . . . 6 (𝑦 = (𝑁‘𝐴) → (𝐴𝐺𝑦) = (𝐴𝐺(𝑁‘𝐴)))
2221eqeq1d 2763 . . . . 5 (𝑦 = (𝑁‘𝐴) → ((𝐴𝐺𝑦) = 𝑈 ↔ (𝐴𝐺(𝑁‘𝐴)) = 𝑈))
2320, 22anbi12d 644 . . . 4 (𝑦 = (𝑁‘𝐴) → (((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈) ↔ (((𝑁‘𝐴)𝐺𝐴) = 𝑈 ∧ (𝐴𝐺(𝑁‘𝐴)) = 𝑈)))
2423elrab 3645 . . 3 ((𝑁‘𝐴) ∈ {𝑦 ∈ 𝑋 ∣ ((𝑦𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝑦) = 𝑈)} ↔ ((𝑁‘𝐴) ∈ 𝑋 ∧ (((𝑁‘𝐴)𝐺𝐴) = 𝑈 ∧ (𝐴𝐺(𝑁‘𝐴)) = 𝑈)))
2518, 24sylib 221 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) ∈ 𝑋 ∧ (((𝑁‘𝐴)𝐺𝐴) = 𝑈 ∧ (𝐴𝐺(𝑁‘𝐴)) = 𝑈)))
2625simprd 501 1 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (((𝑁‘𝐴)𝐺𝐴) = 𝑈 ∧ (𝐴𝐺(𝑁‘𝐴)) = 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  ∃!wreu 3364  {crab 3413  ran crn 5652  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  GrpOpcgr 31091  GIdcgi 31092  invcgn 31093
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-grpo 31095  df-gid 31096  df-ginv 31097
This theorem is used by:  grpolinv  31128  grporinv  31129
  Copyright terms: Public domain W3C validator