| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpinv11 | GIF version | ||
| Description: The group inverse is one-to-one. (Contributed by NM, 22-Mar-2015.) |
| Ref | Expression |
|---|---|
| grpinvinv.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpinvinv.n | ⊢ 𝑁 = (invg‘𝐺) |
| grpinv11.g | ⊢ (𝜑 → 𝐺 ∈ Grp) |
| grpinv11.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| grpinv11.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| grpinv11 | ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) ↔ 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 5632 | . . . . 5 ⊢ ((𝑁‘𝑋) = (𝑁‘𝑌) → (𝑁‘(𝑁‘𝑋)) = (𝑁‘(𝑁‘𝑌))) | |
| 2 | 1 | adantl 277 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑋)) = (𝑁‘(𝑁‘𝑌))) |
| 3 | grpinv11.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Grp) | |
| 4 | grpinv11.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 5 | grpinvinv.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 6 | grpinvinv.n | . . . . . . 7 ⊢ 𝑁 = (invg‘𝐺) | |
| 7 | 5, 6 | grpinvinv 13621 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 8 | 3, 4, 7 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 10 | grpinv11.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 11 | 5, 6 | grpinvinv 13621 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 12 | 3, 10, 11 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 2, 9, 13 | 3eqtr3d 2270 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → 𝑋 = 𝑌) |
| 15 | 14 | ex 115 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) → 𝑋 = 𝑌)) |
| 16 | fveq2 5632 | . 2 ⊢ (𝑋 = 𝑌 → (𝑁‘𝑋) = (𝑁‘𝑌)) | |
| 17 | 15, 16 | impbid1 142 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ‘cfv 5321 Basecbs 13053 Grpcgrp 13554 invgcminusg 13555 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-cnex 8106 ax-resscn 8107 ax-1re 8109 ax-addrcl 8112 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4385 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-riota 5963 df-ov 6013 df-inn 9127 df-2 9185 df-ndx 13056 df-slot 13057 df-base 13059 df-plusg 13144 df-0g 13312 df-mgm 13410 df-sgrp 13456 df-mnd 13471 df-grp 13557 df-minusg 13558 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |