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

Theorem grpoinvop 31135
Description: The inverse of the group operation reverses the arguments. Lemma 2.2.1(d) of [Herstein] p. 55. (Contributed by NM, 27-Oct-2006.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpasscan1.1 𝑋 = ran 𝐺
grpasscan1.2 𝑁 = (inv‘𝐺)
Assertion
Ref Expression
grpoinvop ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)))

Proof of Theorem grpoinvop
StepHypRef Expression
1 simp1 1154 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐺 ∈ GrpOp)
2 simp2 1155 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋)
3 simp3 1156 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋)
4 grpasscan1.1 . . . . . . 7 𝑋 = ran 𝐺
5 grpasscan1.2 . . . . . . 7 𝑁 = (inv‘𝐺)
64, 5grpoinvcl 31126 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋)
763adant2 1149 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋)
84, 5grpoinvcl 31126 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
983adant3 1150 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
104grpocl 31102 . . . . 5 ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐵) ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋) → ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)
111, 7, 9, 10syl3anc 1398 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)
124grpoass 31105 . . . 4 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))))
131, 2, 3, 11, 12syl13anc 1399 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))))
14 eqid 2761 . . . . . . . 8 (GId‘𝐺) = (GId‘𝐺)
154, 14, 5grporinv 31129 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝑁‘𝐵)) = (GId‘𝐺))
16153adant2 1149 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝑁‘𝐵)) = (GId‘𝐺))
1716oveq1d 7435 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = ((GId‘𝐺)𝐺(𝑁‘𝐴)))
184grpoass 31105 . . . . . 6 ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ (𝑁‘𝐵) ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))))
191, 3, 7, 9, 18syl13anc 1399 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))))
204, 14grpolid 31118 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
218, 20syldan 603 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
22213adant3 1150 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
2317, 19, 223eqtr3d 2804 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝑁‘𝐴))
2423oveq2d 7436 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))) = (𝐴𝐺(𝑁‘𝐴)))
254, 14, 5grporinv 31129 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = (GId‘𝐺))
26253adant3 1150 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = (GId‘𝐺))
2713, 24, 263eqtrd 2800 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺))
284grpocl 31102 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
294, 14, 5grpoinvid1 31130 . . 3 ((𝐺 ∈ GrpOp ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋) → ((𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ↔ ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺)))
301, 28, 11, 29syl3anc 1398 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ↔ ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺)))
3127, 30mpbird 260 1 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ran crn 5652  ‘cfv 6538  (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:  grpoinvdiv  31139
  Copyright terms: Public domain W3C validator