ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  subgabl GIF version

Theorem subgabl 13918
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.
StepHypRef Expression
1 subgabl.h . . . 4 𝐻 = (𝐺s 𝑆)
21subgbas 13764 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
32adantl 277 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 = (Base‘𝐻))
41a1i 9 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 = (𝐺s 𝑆))
5 eqid 2231 . . . 4 (+g𝐺) = (+g𝐺)
65a1i 9 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (+g𝐺) = (+g𝐺))
7 simpr 110 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝑆 ∈ (SubGrp‘𝐺))
8 simpl 109 . . 3 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐺 ∈ Abel)
94, 6, 7, 8ressplusgd 13211 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → (+g𝐺) = (+g𝐻))
101subggrp 13763 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
1110adantl 277 . 2 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Grp)
12 simp1l 1047 . . 3 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝐺 ∈ Abel)
13 simp1r 1048 . . . . 5 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
14 eqid 2231 . . . . . 6 (Base‘𝐺) = (Base‘𝐺)
1514subgss 13760 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
1613, 15syl 14 . . . 4 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝑆 ⊆ (Base‘𝐺))
17 simp2 1024 . . . 4 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝑥𝑆)
1816, 17sseldd 3228 . . 3 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝑥 ∈ (Base‘𝐺))
19 simp3 1025 . . . 4 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝑦𝑆)
2016, 19sseldd 3228 . . 3 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → 𝑦 ∈ (Base‘𝐺))
2114, 5ablcom 13889 . . 3 ((𝐺 ∈ Abel ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥))
2212, 18, 20, 21syl3anc 1273 . 2 (((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) ∧ 𝑥𝑆𝑦𝑆) → (𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥))
233, 9, 11, 22isabld 13885 1 ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺)) → 𝐻 ∈ Abel)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1004   = wceq 1397  wcel 2202  wss 3200  cfv 5326  (class class class)co 6017  Basecbs 13081  s cress 13082  +gcplusg 13159  Grpcgrp 13582  SubGrpcsubg 13753  Abelcabl 13871
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-iress 13089  df-plusg 13172  df-grp 13585  df-subg 13756  df-cmn 13872  df-abl 13873
This theorem is referenced by:  issubrng2  14223  rnglidlrng  14511
  Copyright terms: Public domain W3C validator