| 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 2230 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺)) | |
| 4 | id 19 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 5 | subgrcl 13731 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 6 | 2, 3, 4, 5 | ressplusgd 13177 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻)) |
| 7 | 6 | 3ad2ant1 1042 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (+g‘𝐺) = (+g‘𝐻)) |
| 8 | eqidd 2230 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 = 𝑋) | |
| 9 | eqid 2229 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 10 | eqid 2229 | . . . . 5 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
| 11 | 1, 9, 10 | subginv 13733 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) = ((invg‘𝐻)‘𝑌)) |
| 12 | 11 | 3adant2 1040 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) = ((invg‘𝐻)‘𝑌)) |
| 13 | 7, 8, 12 | oveq123d 6028 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 14 | eqid 2229 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 15 | 14 | subgss 13726 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 16 | 15 | 3ad2ant1 1042 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺)) |
| 17 | simp2 1022 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 18 | 16, 17 | sseldd 3225 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐺)) |
| 19 | simp3 1023 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ 𝑆) | |
| 20 | 16, 19 | sseldd 3225 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘𝐺)) |
| 21 | eqid 2229 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 22 | subgsubcl.p | . . . 4 ⊢ − = (-g‘𝐺) | |
| 23 | 14, 21, 9, 22 | grpsubval 13594 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ 𝑌 ∈ (Base‘𝐺)) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 24 | 18, 20, 23 | syl2anc 411 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 25 | 1 | subgbas 13730 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻)) |
| 26 | 25 | 3ad2ant1 1042 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 = (Base‘𝐻)) |
| 27 | 17, 26 | eleqtrd 2308 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐻)) |
| 28 | 19, 26 | eleqtrd 2308 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘𝐻)) |
| 29 | eqid 2229 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 30 | eqid 2229 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 31 | subgsub.n | . . . 4 ⊢ 𝑁 = (-g‘𝐻) | |
| 32 | 29, 30, 10, 31 | grpsubval 13594 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝐻) ∧ 𝑌 ∈ (Base‘𝐻)) → (𝑋𝑁𝑌) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 33 | 27, 28, 32 | syl2anc 411 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋𝑁𝑌) = (𝑋(+g‘𝐻)((invg‘𝐻)‘𝑌))) |
| 34 | 13, 24, 33 | 3eqtr4d 2272 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋𝑁𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ⊆ wss 3197 ‘cfv 5318 (class class class)co 6007 Basecbs 13047 ↾s cress 13048 +gcplusg 13125 Grpcgrp 13548 invgcminusg 13549 -gcsg 13550 SubGrpcsubg 13719 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-i2m1 8115 ax-0lt1 8116 ax-0id 8118 ax-rnegex 8119 ax-pre-ltirr 8122 ax-pre-ltadd 8126 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-pnf 8194 df-mnf 8195 df-ltxr 8197 df-inn 9122 df-2 9180 df-ndx 13050 df-slot 13051 df-base 13053 df-sets 13054 df-iress 13055 df-plusg 13138 df-0g 13306 df-mgm 13404 df-sgrp 13450 df-mnd 13465 df-grp 13551 df-minusg 13552 df-sbg 13553 df-subg 13722 |
| This theorem is referenced by: zringsubgval 14584 zndvds 14628 |
| Copyright terms: Public domain | W3C validator |