Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > grpo2inv | Structured version Visualization version GIF version |
Description: Double inverse law for groups. Lemma 2.2.1(c) of [Herstein] p. 55. (Contributed by NM, 27-Oct-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
grpasscan1.1 | ⊢ 𝑋 = ran 𝐺 |
grpasscan1.2 | ⊢ 𝑁 = (inv‘𝐺) |
Ref | Expression |
---|---|
grpo2inv | ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | grpasscan1.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
2 | grpasscan1.2 | . . . . 5 ⊢ 𝑁 = (inv‘𝐺) | |
3 | 1, 2 | grpoinvcl 28295 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋) |
4 | eqid 2821 | . . . . 5 ⊢ (GId‘𝐺) = (GId‘𝐺) | |
5 | 1, 4, 2 | grporinv 28298 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → ((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = (GId‘𝐺)) |
6 | 3, 5 | syldan 593 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = (GId‘𝐺)) |
7 | 1, 4, 2 | grpolinv 28297 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺𝐴) = (GId‘𝐺)) |
8 | 6, 7 | eqtr4d 2859 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = ((𝑁‘𝐴)𝐺𝐴)) |
9 | 1, 2 | grpoinvcl 28295 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) ∈ 𝑋) |
10 | 3, 9 | syldan 593 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) ∈ 𝑋) |
11 | simpr 487 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
12 | 10, 11, 3 | 3jca 1124 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘(𝑁‘𝐴)) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) |
13 | 1 | grpolcan 28301 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝑁‘(𝑁‘𝐴)) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) → (((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = ((𝑁‘𝐴)𝐺𝐴) ↔ (𝑁‘(𝑁‘𝐴)) = 𝐴)) |
14 | 12, 13 | syldan 593 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = ((𝑁‘𝐴)𝐺𝐴) ↔ (𝑁‘(𝑁‘𝐴)) = 𝐴)) |
15 | 8, 14 | mpbid 234 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ran crn 5551 ‘cfv 6350 (class class class)co 7150 GrpOpcgr 28260 GIdcgi 28261 invcgn 28262 |
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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-grpo 28264 df-gid 28265 df-ginv 28266 |
This theorem is referenced by: grpoinvf 28303 grpodivinv 28307 grpoinvdiv 28308 nvnegneg 28420 |
Copyright terms: Public domain | W3C validator |