Theorem grpoinvop 31192

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

Step	Hyp	Ref	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‘𝐺)
6	4, 5	grpoinvcl 31183	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋)
7	6	3adant2 1149	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋)
8	4, 5	grpoinvcl 31183	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
9	8	3adant3 1150	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
10	4	grpocl 31159	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐵) ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋) → ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)
11	1, 7, 9, 10	syl3anc 1399	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)
12	4	grpoass 31162	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))))
13	1, 2, 3, 11, 12	syl13anc 1400	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))))
14		eqid 2763	. . . . . . . 8 ⊢ (GId‘𝐺) = (GId‘𝐺)
15	4, 14, 5	grporinv 31186	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝑁‘𝐵)) = (GId‘𝐺))
16	15	3adant2 1149	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺(𝑁‘𝐵)) = (GId‘𝐺))
17	16	oveq1d 7466	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = ((GId‘𝐺)𝐺(𝑁‘𝐴)))
18	4	grpoass 31162	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ (𝑁‘𝐵) ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))))
19	1, 3, 7, 9, 18	syl13anc 1400	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐵𝐺(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))))
20	4, 14	grpolid 31175	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
21	8, 20	syldan 603	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
22	21	3adant3 1150	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺(𝑁‘𝐴)) = (𝑁‘𝐴))
23	17, 19, 22	3eqtr3d 2806	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (𝑁‘𝐴))
24	23	oveq2d 7467	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(𝐵𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴)))) = (𝐴𝐺(𝑁‘𝐴)))
25	4, 14, 5	grporinv 31186	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = (GId‘𝐺))
26	25	3adant3 1150	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(𝑁‘𝐴)) = (GId‘𝐺))
27	13, 24, 26	3eqtrd 2802	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺))
28	4	grpocl 31159	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
29	4, 14, 5	grpoinvid1 31187	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ∈ 𝑋) → ((𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ↔ ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺)))
30	1, 28, 11, 29	syl3anc 1399	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)) ↔ ((𝐴𝐺𝐵)𝐺((𝑁‘𝐵)𝐺(𝑁‘𝐴))) = (GId‘𝐺)))
31	27, 30	mpbird 260	1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺𝐵)) = ((𝑁‘𝐵)𝐺(𝑁‘𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ran crn 5659  ‘cfv 6566  (class class class)co 7451  GrpOpcgr 31148  GIdcgi 31149  invcgn 31150

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-grpo 31152  df-gid 31153  df-ginv 31154

This theorem is used by:  grpoinvdiv  31196