Theorem subgabl 14136

Description: A subgroup of an abelian group is also abelian. (Contributed by Mario Carneiro, 3-Dec-2014.)

Hypothesis

Ref	Expression
subgabl.h	⊢ 𝐻 = (𝐺 ↾s 𝑆)

Assertion

Ref	Expression
subgabl	⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel)

Proof of Theorem subgabl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subgabl.h	. . . 4 ⊢ 𝐻 = (𝐺 ↾s 𝑆)
2	1	subgbas 13981	. . 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 13483	. 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (+g‘𝐺) = (+g‘𝐻))
10	1	subggrp 13980	. . 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 13977	. . . . 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 14106	. . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))
22	12, 18, 20, 21	syl3anc 1278	. 2 ⊢ (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))
23	3, 9, 11, 22	isabld 14102	1 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209   ⊆ wss 3220  ‘cfv 5377  (class class class)co 6085  Basecbs 13352   ↾_s cress 13353  +_gcplusg 13431  Grpcgrp 13805  SubGrpcsubg 13970  Abelcabl 14088

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-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-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-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-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  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-grp 13808  df-subg 13973  df-cmn 14089  df-abl 14090

This theorem is used by:  issubrng2  14518  rnglidlrng  14835