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

Theorem subg0 13918
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 2234 . . . . . 6 (+g𝐺) = (+g𝐺)
43a1i 9 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐺))
5 id 19 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6 subgrcl 13917 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
72, 4, 5, 6ressplusgd 13363 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
87oveqd 6069 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → ((0g𝐻)(+g𝐺)(0g𝐻)) = ((0g𝐻)(+g𝐻)(0g𝐻)))
91subggrp 13915 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
10 eqid 2234 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
11 eqid 2234 . . . . . 6 (0g𝐻) = (0g𝐻)
1210, 11grpidcl 13763 . . . . 5 (𝐻 ∈ Grp → (0g𝐻) ∈ (Base‘𝐻))
139, 12syl 14 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐻) ∈ (Base‘𝐻))
14 eqid 2234 . . . . 5 (+g𝐻) = (+g𝐻)
1510, 14, 11grplid 13765 . . . 4 ((𝐻 ∈ Grp ∧ (0g𝐻) ∈ (Base‘𝐻)) → ((0g𝐻)(+g𝐻)(0g𝐻)) = (0g𝐻))
169, 13, 15syl2anc 411 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → ((0g𝐻)(+g𝐻)(0g𝐻)) = (0g𝐻))
178, 16eqtrd 2267 . 2 (𝑆 ∈ (SubGrp‘𝐺) → ((0g𝐻)(+g𝐺)(0g𝐻)) = (0g𝐻))
18 eqid 2234 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
1918subgss 13912 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
201subgbas 13916 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
2113, 20eleqtrrd 2314 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐻) ∈ 𝑆)
2219, 21sseldd 3241 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → (0g𝐻) ∈ (Base‘𝐺))
23 subg0.i . . . 4 0 = (0g𝐺)
2418, 3, 23grpid 13773 . . 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 1398  wcel 2205  cfv 5354  (class class class)co 6052  Basecbs 13233  s cress 13234  +gcplusg 13311  0gc0g 13490  Grpcgrp 13734  SubGrpcsubg 13905
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8223  ax-resscn 8224  ax-1cn 8225  ax-1re 8226  ax-icn 8227  ax-addcl 8228  ax-addrcl 8229  ax-mulcl 8230  ax-addcom 8232  ax-addass 8234  ax-i2m1 8237  ax-0lt1 8238  ax-0id 8240  ax-rnegex 8241  ax-pre-ltirr 8244  ax-pre-ltadd 8248
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-pnf 8315  df-mnf 8316  df-ltxr 8318  df-inn 9243  df-2 9301  df-ndx 13236  df-slot 13237  df-base 13239  df-sets 13240  df-iress 13241  df-plusg 13324  df-0g 13492  df-mgm 13590  df-sgrp 13636  df-mnd 13651  df-grp 13737  df-subg 13908
This theorem is referenced by:  subginv  13919  subg0cl  13920  subgmulg  13926  subrng0  14375  subrg0  14396  mpl0fi  14906
  Copyright terms: Public domain W3C validator