| 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 5603 | . . . . 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 13566 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 8 | 3, 4, 7 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| 10 | grpinv11.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 11 | 5, 6 | grpinvinv 13566 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 12 | 3, 10, 11 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 2, 9, 13 | 3eqtr3d 2250 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → 𝑋 = 𝑌) |
| 15 | 14 | ex 115 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) → 𝑋 = 𝑌)) |
| 16 | fveq2 5603 | . 2 ⊢ (𝑋 = 𝑌 → (𝑁‘𝑋) = (𝑁‘𝑌)) | |
| 17 | 15, 16 | impbid1 142 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1375 ∈ wcel 2180 ‘cfv 5294 Basecbs 12998 Grpcgrp 13499 invgcminusg 13500 |
| 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 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-cnex 8058 ax-resscn 8059 ax-1re 8061 ax-addrcl 8064 |
| This theorem depends on definitions: df-bi 117 df-3an 985 df-tru 1378 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-un 3181 df-in 3183 df-ss 3190 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-id 4361 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-riota 5927 df-ov 5977 df-inn 9079 df-2 9137 df-ndx 13001 df-slot 13002 df-base 13004 df-plusg 13089 df-0g 13257 df-mgm 13355 df-sgrp 13401 df-mnd 13416 df-grp 13502 df-minusg 13503 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |