| 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 13982 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 6 | 2, 3, 4, 5 | ressplusgd 13483 | . . . 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 13984 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) = ((invg‘𝐻)‘𝑌)) |
| 12 | 11 | 3adant2 1047 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) = ((invg‘𝐻)‘𝑌)) |
| 13 | 7, 8, 12 | oveq123d 6106 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 14 | eqid 2238 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 15 | 14 | subgss 13977 | . . . . 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 13851 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ 𝑌 ∈ (Base‘𝐺)) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 24 | 18, 20, 23 | syl2anc 415 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 25 | 1 | subgbas 13981 | . . . . 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 13851 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 ‘cfv 5377 (class class class)co 6085 Basecbs 13352 ↾s cress 13353 +gcplusg 13431 Grpcgrp 13805 invgcminusg 13806 -gcsg 13807 SubGrpcsubg 13970 |
| This proof depends on 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 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-pre-ltirr 8291 ax-pre-ltadd 8295 |
| This proof 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 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-pnf 8362 df-mnf 8363 df-ltxr 8365 df-inn 9305 df-2 9363 df-ndx 13355 df-slot 13356 df-base 13358 df-sets 13359 df-iress 13360 df-plusg 13444 df-0g 13612 df-mgm 13676 df-sgrp 13717 df-mnd 13730 df-grp 13808 df-minusg 13809 df-sbg 13810 df-subg 13973 |
| This theorem is used by: zringsubgval 14940 zndvds 14984 |
| Copyright terms: Public domain | W3C validator |