| 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 5642 | . . . . 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 13673 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 8 | 3, 4, 7 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 10 | grpinv11.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 11 | 5, 6 | grpinvinv 13673 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 12 | 3, 10, 11 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 2, 9, 13 | 3eqtr3d 2271 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → 𝑋 = 𝑌) |
| 15 | 14 | ex 115 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) → 𝑋 = 𝑌)) |
| 16 | fveq2 5642 | . 2 ⊢ (𝑋 = 𝑌 → (𝑁‘𝑋) = (𝑁‘𝑌)) | |
| 17 | 15, 16 | impbid1 142 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2201 ‘cfv 5328 Basecbs 13105 Grpcgrp 13606 invgcminusg 13607 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-cnex 8128 ax-resscn 8129 ax-1re 8131 ax-addrcl 8134 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-inn 9149 df-2 9207 df-ndx 13108 df-slot 13109 df-base 13111 df-plusg 13196 df-0g 13364 df-mgm 13462 df-sgrp 13508 df-mnd 13523 df-grp 13609 df-minusg 13610 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |