grpinvinv - Metamath Proof Explorer

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

Theorem grpinvinv 19036

Description: Double inverse law for groups. Lemma 2.2.1(c) of [Herstein] p. 55. (Contributed by NM, 31-Mar-2014.)

**Hypotheses**
Ref	Expression
grpinvinv.b	⊢ 𝐵 = (Base‘𝐺)
grpinvinv.n	⊢ 𝑁 = (inv_g‘𝐺)

**Assertion**
Ref	Expression
grpinvinv	⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋)

**Proof of Theorem grpinvinv**
Step	Hyp	Ref	Expression
1		grpinvinv.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
2		grpinvinv.n	. . . . 5 ⊢ 𝑁 = (inv_g‘𝐺)
3	1, 2	grpinvcl 19018	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵)
4		eqid 2735	. . . . 5 ⊢ (+_g‘𝐺) = (+_g‘𝐺)
5		eqid 2735	. . . . 5 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
6	1, 4, 5, 2	grprinv 19021	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋)(+_g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0_g‘𝐺))
7	3, 6	syldan 591	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+_g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0_g‘𝐺))
8	1, 4, 5, 2	grplinv 19020	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+_g‘𝐺)𝑋) = (0_g‘𝐺))
9	7, 8	eqtr4d 2778	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+_g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+_g‘𝐺)𝑋))
10		simpl 482	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ Grp)
11	1, 2	grpinvcl 19018	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵)
12	3, 11	syldan 591	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵)
13		simpr 484	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
14	1, 4	grplcan 19031	. . 3 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘(𝑁‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (((𝑁‘𝑋)(+_g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+_g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋))
15	10, 12, 13, 3, 14	syl13anc 1371	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋)(+_g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+_g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋))
16	9, 15	mpbid 232	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ‘cfv 6563 (class class class)co 7431 Basecbs 17245 +_gcplusg 17298 0_gc0g 17486 Grpcgrp 18964 inv_gcminusg 18965

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-fv 6571 df-riota 7388 df-ov 7434 df-0g 17488 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-grp 18967 df-minusg 18968

This theorem is referenced by: grpinv11 19038 grpinv11OLD 19039 grpinvnz 19041 grpsubinv 19043 grpinvsub 19053 grpsubeq0 19057 grpnpcan 19063 mulgneg 19123 mulgnegneg 19124 mulginvinv 19131 mulgdir 19137 mulgass 19142 eqger 19209 frgpuptinv 19804 ablsub2inv 19841 mulgdi 19859 invghm 19866 rngm2neg 20187 unitinvinv 20408 unitnegcl 20414 irrednegb 20448 abvneg 20844 lspsnneg 21022 islindf4 21876 tgpconncomp 24137 archirngz 33179 archiabllem1b 33182 ply1divalg3 35627 baerlem5amN 41699 baerlem5bmN 41700 baerlem5abmN 41701 fldhmf1 42072 nelsubginvcld 42483

W3C validator