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

Theorem subg0 14036
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 2238 . . . . . 6 (+g‘𝐺) = (+g‘𝐺)
43a1i 9 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐺))
5 id 19 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
6 subgrcl 14035 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
72, 4, 5, 6ressplusgd 13536 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (+g‘𝐺) = (+g‘𝐻))
87oveqd 6102 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → ((0g‘𝐻)(+g‘𝐺)(0g‘𝐻)) = ((0g‘𝐻)(+g‘𝐻)(0g‘𝐻)))
91subggrp 14033 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
10 eqid 2238 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
11 eqid 2238 . . . . . 6 (0g‘𝐻) = (0g‘𝐻)
1210, 11grpidcl 13887 . . . . 5 (𝐻 ∈ Grp → (0g‘𝐻) ∈ (Base‘𝐻))
139, 12syl 14 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g‘𝐻) ∈ (Base‘𝐻))
14 eqid 2238 . . . . 5 (+g‘𝐻) = (+g‘𝐻)
1510, 14, 11grplid 13889 . . . 4 ((𝐻 ∈ Grp ∧ (0g‘𝐻) ∈ (Base‘𝐻)) → ((0g‘𝐻)(+g‘𝐻)(0g‘𝐻)) = (0g‘𝐻))
169, 13, 15syl2anc 415 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → ((0g‘𝐻)(+g‘𝐻)(0g‘𝐻)) = (0g‘𝐻))
178, 16eqtrd 2271 . 2 (𝑆 ∈ (SubGrp‘𝐺) → ((0g‘𝐻)(+g‘𝐺)(0g‘𝐻)) = (0g‘𝐻))
18 eqid 2238 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
1918subgss 14030 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
201subgbas 14034 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
2113, 20eleqtrrd 2318 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (0g‘𝐻) ∈ 𝑆)
2219, 21sseldd 3249 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → (0g‘𝐻) ∈ (Base‘𝐺))
23 subg0.i . . . 4 0 = (0g‘𝐺)
2418, 3, 23grpid 13897 . . 3 ((𝐺 ∈ Grp ∧ (0g‘𝐻) ∈ (Base‘𝐺)) → (((0g‘𝐻)(+g‘𝐺)(0g‘𝐻)) = (0g‘𝐻) ↔ 0 = (0g‘𝐻)))
256, 22, 24syl2anc 415 . 2 (𝑆 ∈ (SubGrp‘𝐺) → (((0g‘𝐻)(+g‘𝐺)(0g‘𝐻)) = (0g‘𝐻) ↔ 0 = (0g‘𝐻)))
2617, 25mpbid 147 1 (𝑆 ∈ (SubGrp‘𝐺) → 0 = (0g‘𝐻))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ‘cfv 5377  (class class class)co 6085  Basecbs 13404   ↾s cress 13405  +gcplusg 13484  0gc0g 13663  Grpcgrp 13858  SubGrpcsubg 14023
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 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-ltadd 8296
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-reu 2535  df-rmo 2536  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-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-subg 14026
This theorem is used by:  subginv  14037  subg0cl  14038  subgmulg  14044  subrng0  14599  subrg0  14620  mpl0fi  15184
  Copyright terms: Public domain W3C validator