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

Theorem grpoinvid2 31190
Description: The inverse of a group element expressed in terms of the identity element. (Contributed by NM, 27-Oct-2006.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpinv.1 𝑋 = ran 𝐺
grpinv.2 𝑈 = (GId‘𝐺)
grpinv.3 𝑁 = (inv‘𝐺)
Assertion
Ref Expression
grpoinvid2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐴) = 𝐵 ↔ (𝐵𝐺𝐴) = 𝑈))

Proof of Theorem grpoinvid2
StepHypRef Expression
1 oveq1 7457 . . . 4 ((𝑁‘𝐴) = 𝐵 → ((𝑁‘𝐴)𝐺𝐴) = (𝐵𝐺𝐴))
21adantl 487 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑁‘𝐴) = 𝐵) → ((𝑁‘𝐴)𝐺𝐴) = (𝐵𝐺𝐴))
3 grpinv.1 . . . . . 6 𝑋 = ran 𝐺
4 grpinv.2 . . . . . 6 𝑈 = (GId‘𝐺)
5 grpinv.3 . . . . . 6 𝑁 = (inv‘𝐺)
63, 4, 5grpolinv 31187 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺𝐴) = 𝑈)
763adant3 1151 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐴)𝐺𝐴) = 𝑈)
87adantr 486 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑁‘𝐴) = 𝐵) → ((𝑁‘𝐴)𝐺𝐴) = 𝑈)
92, 8eqtr3d 2803 . 2 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑁‘𝐴) = 𝐵) → (𝐵𝐺𝐴) = 𝑈)
103, 5grpoinvcl 31185 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
113, 4grpolid 31177 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → (𝑈𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
1210, 11syldan 603 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑈𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
13123adant3 1151 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
1413eqcomd 2772 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐴) = (𝑈𝐺(𝑁‘𝐴)))
1514adantr 486 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐵𝐺𝐴) = 𝑈) → (𝑁‘𝐴) = (𝑈𝐺(𝑁‘𝐴)))
16 oveq1 7457 . . . 4 ((𝐵𝐺𝐴) = 𝑈 → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = (𝑈𝐺(𝑁‘𝐴)))
1716adantl 487 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐵𝐺𝐴) = 𝑈) → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = (𝑈𝐺(𝑁‘𝐴)))
18 simprr 785 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐵 ∈ 𝑋)
19 simprl 783 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
2010adantrr 730 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑁‘𝐴) ∈ 𝑋)
2118, 19, 203jca 1147 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋))
223grpoass 31164 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = (𝐵𝐺(𝐴𝐺(𝑁‘𝐴))))
2321, 22syldan 603 . . . . . 6 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = (𝐵𝐺(𝐴𝐺(𝑁‘𝐴))))
24233impb 1133 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = (𝐵𝐺(𝐴𝐺(𝑁‘𝐴))))
253, 4, 5grporinv 31188 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = 𝑈)
2625oveq2d 7466 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐵𝐺(𝐴𝐺(𝑁‘𝐴))) = (𝐵𝐺𝑈))
27263adant3 1151 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝐴𝐺(𝑁‘𝐴))) = (𝐵𝐺𝑈))
283, 4grporid 31178 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺𝑈) = 𝐵)
29283adant2 1150 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺𝑈) = 𝐵)
3024, 27, 293eqtrd 2805 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = 𝐵)
3130adantr 486 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐵𝐺𝐴) = 𝑈) → ((𝐵𝐺𝐴)𝐺(𝑁‘𝐴)) = 𝐵)
3215, 17, 313eqtr2d 2807 . 2 (((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐵𝐺𝐴) = 𝑈) → (𝑁‘𝐴) = 𝐵)
339, 32impbida 813 1 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐴) = 𝐵 ↔ (𝐵𝐺𝐴) = 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ran crn 5658  ‘cfv 6565  (class class class)co 7450  GrpOpcgr 31150  GIdcgi 31151  invcgn 31152
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-grpo 31154  df-gid 31155  df-ginv 31156
This theorem is used by:  rngonegmn1r  39144
  Copyright terms: Public domain W3C validator