| 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 13828 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻)) |
| 3 | 2 | adantl 277 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 = (Base‘𝐻)) |
| 4 | 1 | a1i 9 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 = (𝐺 ↾s 𝑆)) |
| 5 | eqid 2231 | . . . 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 13275 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (+g‘𝐺) = (+g‘𝐻)) |
| 10 | 1 | subggrp 13827 | . . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp) |
| 11 | 10 | adantl 277 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Grp) |
| 12 | simp1l 1048 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝐺 ∈ Abel) | |
| 13 | simp1r 1049 | . . . . 5 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 14 | eqid 2231 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 15 | 14 | subgss 13824 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 16 | 13, 15 | syl 14 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺)) |
| 17 | simp2 1025 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆) | |
| 18 | 16, 17 | sseldd 3229 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺)) |
| 19 | simp3 1026 | . . . 4 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝑆) | |
| 20 | 16, 19 | sseldd 3229 | . . 3 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ (Base‘𝐺)) |
| 21 | 14, 5 | ablcom 13953 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
| 22 | 12, 18, 20, 21 | syl3anc 1274 | . 2 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
| 23 | 3, 9, 11, 22 | isabld 13949 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ⊆ wss 3201 ‘cfv 5333 (class class class)co 6028 Basecbs 13145 ↾s cress 13146 +gcplusg 13223 Grpcgrp 13646 SubGrpcsubg 13817 Abelcabl 13935 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-ltxr 8261 df-inn 9186 df-2 9244 df-ndx 13148 df-slot 13149 df-base 13151 df-sets 13152 df-iress 13153 df-plusg 13236 df-grp 13649 df-subg 13820 df-cmn 13936 df-abl 13937 |
| This theorem is referenced by: issubrng2 14288 rnglidlrng 14577 |
| Copyright terms: Public domain | W3C validator |