![]() |
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 5517 | . . . . 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 12943 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
8 | 3, 4, 7 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
10 | grpinv11.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
11 | 5, 6 | grpinvinv 12943 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
12 | 3, 10, 11 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
14 | 2, 9, 13 | 3eqtr3d 2218 | . . 3 ⊢ ((𝜑 ∧ (𝑁‘𝑋) = (𝑁‘𝑌)) → 𝑋 = 𝑌) |
15 | 14 | ex 115 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) → 𝑋 = 𝑌)) |
16 | fveq2 5517 | . 2 ⊢ (𝑋 = 𝑌 → (𝑁‘𝑋) = (𝑁‘𝑌)) | |
17 | 15, 16 | impbid1 142 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑁‘𝑌) ↔ 𝑋 = 𝑌)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 ‘cfv 5218 Basecbs 12465 Grpcgrp 12883 invgcminusg 12884 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-cnex 7905 ax-resscn 7906 ax-1re 7908 ax-addrcl 7911 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5834 df-ov 5881 df-inn 8923 df-2 8981 df-ndx 12468 df-slot 12469 df-base 12471 df-plusg 12552 df-0g 12713 df-mgm 12781 df-sgrp 12814 df-mnd 12824 df-grp 12886 df-minusg 12887 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |