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

Theorem grpoinvop 31144
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 31135 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋)
763adant2 1149 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋)
84, 5grpoinvcl 31135 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
983adant3 1150 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
104grpocl 31111 . . . . 5 ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐵) ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋) → ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)
111, 7, 9, 10syl3anc 1398 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)
124grpoass 31114 . . . 4 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))))
131, 2, 3, 11, 12syl13anc 1399 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))))
14 eqid 2760 . . . . . . . 8 (GId‘𝐺) = (GId‘𝐺)
154, 14, 5grporinv 31138 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝑁‘𝐵)) = (GId‘𝐺))
16153adant2 1149 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝑁‘𝐵)) = (GId‘𝐺))
1716oveq1d 7439 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = ((GId‘𝐺)𝐺(𝑁‘𝐴)))
184grpoass 31114 . . . . . 6 ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ (𝑁‘𝐵) ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))))
191, 3, 7, 9, 18syl13anc 1399 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))))
204, 14grpolid 31127 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
218, 20syldan 603 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
22213adant3 1150 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
2317, 19, 223eqtr3d 2803 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝑁‘𝐴))
2423oveq2d 7440 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))) = (𝐴𝐺(𝑁‘𝐴)))
254, 14, 5grporinv 31138 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = (GId‘𝐺))
26253adant3 1150 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = (GId‘𝐺))
2713, 24, 263eqtrd 2799 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺))
284grpocl 31111 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
294, 14, 5grpoinvid1 31139 . . 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 1569   ∈ wcel 2144  ran crn 5652  ‘cfv 6543  (class class class)co 7424  GrpOpcgr 31100  GIdcgi 31101  invcgn 31102
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  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 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-grpo 31104  df-gid 31105  df-ginv 31106
This theorem is used by:  grpoinvdiv  31148
  Copyright terms: Public domain W3C validator