| 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 30949 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋) |
| 4 | eqid 2765 | . . . . 5 ⊢ (GId‘𝐺) = (GId‘𝐺) | |
| 5 | 1, 4, 2 | grporinv 30952 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → ((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = (GId‘𝐺)) |
| 6 | 3, 5 | syldan 603 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = (GId‘𝐺)) |
| 7 | 1, 4, 2 | grpolinv 30951 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺𝐴) = (GId‘𝐺)) |
| 8 | 6, 7 | eqtr4d 2803 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = ((𝑁‘𝐴)𝐺𝐴)) |
| 9 | 1, 2 | grpoinvcl 30949 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑁‘𝐴) ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) ∈ 𝑋) |
| 10 | 3, 9 | syldan 603 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) ∈ 𝑋) |
| 11 | simpr 490 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 12 | 10, 11, 3 | 3jca 1146 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((𝑁‘(𝑁‘𝐴)) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) |
| 13 | 1 | grpolcan 30955 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝑁‘(𝑁‘𝐴)) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋)) → (((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = ((𝑁‘𝐴)𝐺𝐴) ↔ (𝑁‘(𝑁‘𝐴)) = 𝐴)) |
| 14 | 12, 13 | syldan 603 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (((𝑁‘𝐴)𝐺(𝑁‘(𝑁‘𝐴))) = ((𝑁‘𝐴)𝐺𝐴) ↔ (𝑁‘(𝑁‘𝐴)) = 𝐴)) |
| 15 | 8, 14 | mpbid 235 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝑁‘𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ran crn 5664 ‘cfv 6540 (class class class)co 7419 GrpOpcgr 30914 GIdcgi 30915 invcgn 30916 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-grpo 30918 df-gid 30919 df-ginv 30920 |
| This theorem is used by: grpoinvf 30957 grpodivinv 30961 grpoinvdiv 30962 nvnegneg 31074 |
| Copyright terms: Public domain | W3C validator |