| 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 5693 | . . . . 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 13855 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 8 | 3, 4, 7 | syl2anc 415 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 10 | grpinv11.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 11 | 5, 6 | grpinvinv 13855 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 12 | 3, 10, 11 | syl2anc 415 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 2, 9, 13 | 3eqtr3d 2279 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → 𝑋 = 𝑌) |
| 15 | 14 | ex 115 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) → 𝑋 = 𝑌)) |
| 16 | fveq2 5693 | . 2 ⊢ (𝑋 = 𝑌 → (𝑁‘𝑋) = (𝑁‘𝑌)) | |
| 17 | 15, 16 | impbid1 142 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ‘cfv 5375 Basecbs 13335 Grpcgrp 13788 invgcminusg 13789 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-inn 9288 df-2 9346 df-ndx 13338 df-slot 13339 df-base 13341 df-plusg 13427 df-0g 13595 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-grp 13791 df-minusg 13792 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |