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

Theorem subg0 13790
Description: A subgroup of a group must have the same identity as the group. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 30-Apr-2015.)
Hypotheses
Ref Expression
subg0.h 𝐻 = (𝐺s 𝑆)
subg0.i 0 = (0g𝐺)
Assertion
Ref Expression
subg0 (𝑆 ∈ (SubGrp‘𝐺) → 0 = (0g𝐻))

Proof of Theorem subg0
StepHypRef Expression
1 subg0.h . . . . . 6 𝐻 = (𝐺s 𝑆)
21a1i 9 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺s 𝑆))
3 eqid 2230 . . . . . 6 (+g𝐺) = (+g𝐺)
43a1i 9 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐺))
5 id 19 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6 subgrcl 13789 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
72, 4, 5, 6ressplusgd 13235 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
87oveqd 6040 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → ((0g𝐻)(+g𝐺)(0g𝐻)) = ((0g𝐻)(+g𝐻)(0g𝐻)))
91subggrp 13787 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
10 eqid 2230 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
11 eqid 2230 . . . . . 6 (0g𝐻) = (0g𝐻)
1210, 11grpidcl 13635 . . . . 5 (𝐻 ∈ Grp → (0g𝐻) ∈ (Base‘𝐻))
139, 12syl 14 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐻) ∈ (Base‘𝐻))
14 eqid 2230 . . . . 5 (+g𝐻) = (+g𝐻)
1510, 14, 11grplid 13637 . . . 4 ((𝐻 ∈ Grp ∧ (0g𝐻) ∈ (Base‘𝐻)) → ((0g𝐻)(+g𝐻)(0g𝐻)) = (0g𝐻))
169, 13, 15syl2anc 411 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → ((0g𝐻)(+g𝐻)(0g𝐻)) = (0g𝐻))
178, 16eqtrd 2263 . 2 (𝑆 ∈ (SubGrp‘𝐺) → ((0g𝐻)(+g𝐺)(0g𝐻)) = (0g𝐻))
18 eqid 2230 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
1918subgss 13784 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
201subgbas 13788 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
2113, 20eleqtrrd 2310 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐻) ∈ 𝑆)
2219, 21sseldd 3227 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐻) ∈ (Base‘𝐺))
23 subg0.i . . . 4 0 = (0g𝐺)
2418, 3, 23grpid 13645 . . 3 ((𝐺 ∈ Grp ∧ (0g𝐻) ∈ (Base‘𝐺)) → (((0g𝐻)(+g𝐺)(0g𝐻)) = (0g𝐻) ↔ 0 = (0g𝐻)))
256, 22, 24syl2anc 411 . 2 (𝑆 ∈ (SubGrp‘𝐺) → (((0g𝐻)(+g𝐺)(0g𝐻)) = (0g𝐻) ↔ 0 = (0g𝐻)))
2617, 25mpbid 147 1 (𝑆 ∈ (SubGrp‘𝐺) → 0 = (0g𝐻))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1397  wcel 2201  cfv 5328  (class class class)co 6023  Basecbs 13105  s cress 13106  +gcplusg 13183  0gc0g 13362  Grpcgrp 13606  SubGrpcsubg 13777
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 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-addass 8139  ax-i2m1 8142  ax-0lt1 8143  ax-0id 8145  ax-rnegex 8146  ax-pre-ltirr 8149  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-pnf 8221  df-mnf 8222  df-ltxr 8224  df-inn 9149  df-2 9207  df-ndx 13108  df-slot 13109  df-base 13111  df-sets 13112  df-iress 13113  df-plusg 13196  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-grp 13609  df-subg 13780
This theorem is referenced by:  subginv  13791  subg0cl  13792  subgmulg  13798  subrng0  14245  subrg0  14266  mpl0fi  14745
  Copyright terms: Public domain W3C validator