| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subgsub | GIF version | ||
| Description: The subtraction of elements in a subgroup is the same as subtraction in the group. (Contributed by Mario Carneiro, 15-Jun-2015.) |
| Ref | Expression |
|---|---|
| subgsubcl.p | ⊢ − = (-g‘𝐺) |
| subgsub.h | ⊢ 𝐻 = (𝐺 ↾s 𝑆) |
| subgsub.n | ⊢ 𝑁 = (-g‘𝐻) |
| Ref | Expression |
|---|---|
| subgsub | ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋𝑁𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subgsub.h | . . . . . 6 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
| 2 | 1 | a1i 9 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺 ↾s 𝑆)) |
| 3 | eqidd 2239 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺)) | |
| 4 | id 19 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 5 | subgrcl 13959 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 6 | 2, 3, 4, 5 | ressplusgd 13460 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻)) |
| 7 | 6 | 3ad2ant1 1049 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (+g‘𝐺) = (+g‘𝐻)) |
| 8 | eqidd 2239 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 = 𝑋) | |
| 9 | eqid 2238 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 10 | eqid 2238 | . . . . 5 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
| 11 | 1, 9, 10 | subginv 13961 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) = ((invg‘𝐻)‘𝑌)) |
| 12 | 11 | 3adant2 1047 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) = ((invg‘𝐻)‘𝑌)) |
| 13 | 7, 8, 12 | oveq123d 6096 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 14 | eqid 2238 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 15 | 14 | subgss 13954 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 16 | 15 | 3ad2ant1 1049 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺)) |
| 17 | simp2 1029 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 18 | 16, 17 | sseldd 3249 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐺)) |
| 19 | simp3 1030 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ 𝑆) | |
| 20 | 16, 19 | sseldd 3249 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘𝐺)) |
| 21 | eqid 2238 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 22 | subgsubcl.p | . . . 4 ⊢ − = (-g‘𝐺) | |
| 23 | 14, 21, 9, 22 | grpsubval 13828 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ 𝑌 ∈ (Base‘𝐺)) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 24 | 18, 20, 23 | syl2anc 415 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 25 | 1 | subgbas 13958 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻)) |
| 26 | 25 | 3ad2ant1 1049 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 = (Base‘𝐻)) |
| 27 | 17, 26 | eleqtrd 2317 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐻)) |
| 28 | 19, 26 | eleqtrd 2317 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘𝐻)) |
| 29 | eqid 2238 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 30 | eqid 2238 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 31 | subgsub.n | . . . 4 ⊢ 𝑁 = (-g‘𝐻) | |
| 32 | 29, 30, 10, 31 | grpsubval 13828 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝐻) ∧ 𝑌 ∈ (Base‘𝐻)) → (𝑋𝑁𝑌) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 33 | 27, 28, 32 | syl2anc 415 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋𝑁𝑌) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 34 | 13, 24, 33 | 3eqtr4d 2281 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋𝑁𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 ‘cfv 5372 (class class class)co 6075 Basecbs 13330 ↾s cress 13331 +gcplusg 13408 Grpcgrp 13782 invgcminusg 13783 -gcsg 13784 SubGrpcsubg 13947 |
| 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-in1 623 ax-in2 624 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 4241 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-i2m1 8274 ax-0lt1 8275 ax-0id 8277 ax-rnegex 8278 ax-pre-ltirr 8281 ax-pre-ltadd 8285 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 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-ne 2421 df-nel 2516 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-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-pnf 8352 df-mnf 8353 df-ltxr 8355 df-inn 9284 df-2 9342 df-ndx 13333 df-slot 13334 df-base 13336 df-sets 13337 df-iress 13338 df-plusg 13421 df-0g 13589 df-mgm 13653 df-sgrp 13694 df-mnd 13707 df-grp 13785 df-minusg 13786 df-sbg 13787 df-subg 13950 |
| This theorem is referenced by: zringsubgval 14912 zndvds 14956 |
| Copyright terms: Public domain | W3C validator |