| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subginv | Structured version Visualization version GIF version | ||
| Description: The inverse of an element in a subgroup is the same as the inverse in the larger group. (Contributed by Mario Carneiro, 2-Dec-2014.) |
| Ref | Expression |
|---|---|
| subg0.h | ⊢ 𝐻 = (𝐺 ↾s 𝑆) |
| subginv.i | ⊢ 𝐼 = (invg‘𝐺) |
| subginv.j | ⊢ 𝐽 = (invg‘𝐻) |
| Ref | Expression |
|---|---|
| subginv | ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐼‘𝑋) = (𝐽‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subg0.h | . . . . 5 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
| 2 | 1 | subggrp 19042 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp) |
| 3 | 1 | subgbas 19043 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻)) |
| 4 | 3 | eleq2d 2817 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ 𝑆 ↔ 𝑋 ∈ (Base‘𝐻))) |
| 5 | 4 | biimpa 476 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐻)) |
| 6 | eqid 2731 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 7 | eqid 2731 | . . . . 5 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 8 | eqid 2731 | . . . . 5 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 9 | subginv.j | . . . . 5 ⊢ 𝐽 = (invg‘𝐻) | |
| 10 | 6, 7, 8, 9 | grprinv 18903 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝑋(+g‘𝐻)(𝐽‘𝑋)) = (0g‘𝐻)) |
| 11 | 2, 5, 10 | syl2an2r 685 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐻)(𝐽‘𝑋)) = (0g‘𝐻)) |
| 12 | eqid 2731 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 13 | 1, 12 | ressplusg 17195 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻)) |
| 14 | 13 | adantr 480 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (+g‘𝐺) = (+g‘𝐻)) |
| 15 | 14 | oveqd 7363 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (𝑋(+g‘𝐻)(𝐽‘𝑋))) |
| 16 | eqid 2731 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 17 | 1, 16 | subg0 19045 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (0g‘𝐺) = (0g‘𝐻)) |
| 18 | 17 | adantr 480 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (0g‘𝐺) = (0g‘𝐻)) |
| 19 | 11, 15, 18 | 3eqtr4d 2776 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺)) |
| 20 | subgrcl 19044 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 21 | 20 | adantr 480 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝐺 ∈ Grp) |
| 22 | eqid 2731 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 23 | 22 | subgss 19040 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 24 | 23 | sselda 3934 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐺)) |
| 25 | 6, 9 | grpinvcl 18900 | . . . . . . . 8 ⊢ ((𝐻 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐻)) → (𝐽‘𝑋) ∈ (Base‘𝐻)) |
| 26 | 25 | ex 412 | . . . . . . 7 ⊢ (𝐻 ∈ Grp → (𝑋 ∈ (Base‘𝐻) → (𝐽‘𝑋) ∈ (Base‘𝐻))) |
| 27 | 2, 26 | syl 17 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ (Base‘𝐻) → (𝐽‘𝑋) ∈ (Base‘𝐻))) |
| 28 | 3 | eleq2d 2817 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ((𝐽‘𝑋) ∈ 𝑆 ↔ (𝐽‘𝑋) ∈ (Base‘𝐻))) |
| 29 | 27, 4, 28 | 3imtr4d 294 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝑋 ∈ 𝑆 → (𝐽‘𝑋) ∈ 𝑆)) |
| 30 | 29 | imp 406 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐽‘𝑋) ∈ 𝑆) |
| 31 | 23 | sselda 3934 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐽‘𝑋) ∈ 𝑆) → (𝐽‘𝑋) ∈ (Base‘𝐺)) |
| 32 | 30, 31 | syldan 591 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐽‘𝑋) ∈ (Base‘𝐺)) |
| 33 | subginv.i | . . . 4 ⊢ 𝐼 = (invg‘𝐺) | |
| 34 | 22, 12, 16, 33 | grpinvid1 18904 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺) ∧ (𝐽‘𝑋) ∈ (Base‘𝐺)) → ((𝐼‘𝑋) = (𝐽‘𝑋) ↔ (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺))) |
| 35 | 21, 24, 32, 34 | syl3anc 1373 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → ((𝐼‘𝑋) = (𝐽‘𝑋) ↔ (𝑋(+g‘𝐺)(𝐽‘𝑋)) = (0g‘𝐺))) |
| 36 | 19, 35 | mpbird 257 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆) → (𝐼‘𝑋) = (𝐽‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ‘cfv 6481 (class class class)co 7346 Basecbs 17120 ↾s cress 17141 +gcplusg 17161 0gc0g 17343 Grpcgrp 18846 invgcminusg 18847 SubGrpcsubg 19033 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-2 12188 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-0g 17345 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-grp 18849 df-minusg 18850 df-subg 19036 |
| This theorem is referenced by: subginvcl 19048 subgsub 19051 subgmulg 19053 zringlpirlem1 21400 prmirred 21412 psgninv 21520 mplneg 21948 subgtgp 24021 clmneg 25009 qrngneg 27562 |
| Copyright terms: Public domain | W3C validator |