| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subgabl | GIF version | ||
| Description: A subgroup of an abelian group is also abelian. (Contributed by Mario Carneiro, 3-Dec-2014.) |
| Ref | Expression |
|---|---|
| subgabl.h | ⊢ 𝐻 = (𝐺 ↾s 𝑆) |
| Ref | Expression |
|---|---|
| subgabl | ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subgabl.h | . . . 4 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
| 2 | 1 | subgbas 13958 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻)) |
| 3 | 2 | adantl 277 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 = (Base‘𝐻)) |
| 4 | 1 | a1i 9 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 = (𝐺 ↾s 𝑆)) |
| 5 | eqid 2238 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | 5 | a1i 9 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (+g‘𝐺) = (+g‘𝐺)) |
| 7 | simpr 110 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 8 | simpl 109 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐺 ∈ Abel) | |
| 9 | 4, 6, 7, 8 | ressplusgd 13460 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (+g‘𝐺) = (+g‘𝐻)) |
| 10 | 1 | subggrp 13957 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp) |
| 11 | 10 | adantl 277 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Grp) |
| 12 | simp1l 1052 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝐺 ∈ Abel) | |
| 13 | simp1r 1053 | . . . . 5 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 14 | eqid 2238 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 15 | 14 | subgss 13954 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 16 | 13, 15 | syl 14 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺)) |
| 17 | simp2 1029 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆) | |
| 18 | 16, 17 | sseldd 3249 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺)) |
| 19 | simp3 1030 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝑆) | |
| 20 | 16, 19 | sseldd 3249 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ (Base‘𝐺)) |
| 21 | 14, 5 | ablcom 14083 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
| 22 | 12, 18, 20, 21 | syl3anc 1278 | . 2 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
| 23 | 3, 9, 11, 22 | isabld 14079 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 ‘cfv 5372 (class class class)co 6075 Basecbs 13330 ↾s cress 13331 +gcplusg 13408 Grpcgrp 13782 SubGrpcsubg 13947 Abelcabl 14065 |
| 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-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-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-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-fv 5380 df-ov 6078 df-oprab 6079 df-mpo 6080 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-grp 13785 df-subg 13950 df-cmn 14066 df-abl 14067 |
| This theorem is referenced by: issubrng2 14491 rnglidlrng 14807 |
| Copyright terms: Public domain | W3C validator |