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

Theorem qus0 14097
Description: Value of the group identity operation in a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.)
Hypotheses
Ref Expression
qusgrp.h  |-  H  =  ( G  /.s  ( G ~QG  S
) )
qus0.p  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
qus0  |-  ( S  e.  (NrmSGrp `  G
)  ->  [  .0.  ] ( G ~QG  S )  =  ( 0g `  H ) )

Proof of Theorem qus0
StepHypRef Expression
1 nsgsubg 14067 . . . . . . 7  |-  ( S  e.  (NrmSGrp `  G
)  ->  S  e.  (SubGrp `  G ) )
2 subgrcl 14041 . . . . . . 7  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
31, 2syl 14 . . . . . 6  |-  ( S  e.  (NrmSGrp `  G
)  ->  G  e.  Grp )
4 eqid 2238 . . . . . . 7  |-  ( Base `  G )  =  (
Base `  G )
5 qus0.p . . . . . . 7  |-  .0.  =  ( 0g `  G )
64, 5grpidcl 13893 . . . . . 6  |-  ( G  e.  Grp  ->  .0.  e.  ( Base `  G
) )
73, 6syl 14 . . . . 5  |-  ( S  e.  (NrmSGrp `  G
)  ->  .0.  e.  ( Base `  G )
)
8 qusgrp.h . . . . . 6  |-  H  =  ( G  /.s  ( G ~QG  S
) )
9 eqid 2238 . . . . . 6  |-  ( +g  `  G )  =  ( +g  `  G )
10 eqid 2238 . . . . . 6  |-  ( +g  `  H )  =  ( +g  `  H )
118, 4, 9, 10qusadd 14096 . . . . 5  |-  ( ( S  e.  (NrmSGrp `  G
)  /\  .0.  e.  ( Base `  G )  /\  .0.  e.  ( Base `  G ) )  -> 
( [  .0.  ]
( G ~QG  S ) ( +g  `  H ) [  .0.  ] ( G ~QG  S ) )  =  [ (  .0.  ( +g  `  G )  .0.  ) ] ( G ~QG  S ) )
127, 7, 11mpd3an23 1380 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  ( [  .0.  ] ( G ~QG  S ) ( +g  `  H
) [  .0.  ]
( G ~QG  S ) )  =  [ (  .0.  ( +g  `  G )  .0.  ) ] ( G ~QG  S ) )
134, 9, 5grplid 13895 . . . . . 6  |-  ( ( G  e.  Grp  /\  .0.  e.  ( Base `  G
) )  ->  (  .0.  ( +g  `  G
)  .0.  )  =  .0.  )
143, 7, 13syl2anc 415 . . . . 5  |-  ( S  e.  (NrmSGrp `  G
)  ->  (  .0.  ( +g  `  G )  .0.  )  =  .0.  )
1514eceq1d 6847 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  [ (  .0.  ( +g  `  G
)  .0.  ) ] ( G ~QG  S )  =  [  .0.  ] ( G ~QG  S ) )
1612, 15eqtrd 2271 . . 3  |-  ( S  e.  (NrmSGrp `  G
)  ->  ( [  .0.  ] ( G ~QG  S ) ( +g  `  H
) [  .0.  ]
( G ~QG  S ) )  =  [  .0.  ] ( G ~QG  S ) )
178qusgrp 14094 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  H  e.  Grp )
18 eqid 2238 . . . . . 6  |-  ( Base `  H )  =  (
Base `  H )
198, 4, 18quseccl 14095 . . . . 5  |-  ( ( S  e.  (NrmSGrp `  G
)  /\  .0.  e.  ( Base `  G )
)  ->  [  .0.  ] ( G ~QG  S )  e.  (
Base `  H )
)
207, 19mpdan 425 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  [  .0.  ] ( G ~QG  S )  e.  (
Base `  H )
)
21 eqid 2238 . . . . 5  |-  ( 0g
`  H )  =  ( 0g `  H
)
2218, 10, 21grpid 13903 . . . 4  |-  ( ( H  e.  Grp  /\  [  .0.  ] ( G ~QG  S )  e.  ( Base `  H ) )  -> 
( ( [  .0.  ] ( G ~QG  S ) ( +g  `  H ) [  .0.  ] ( G ~QG  S ) )  =  [  .0.  ] ( G ~QG  S )  <->  ( 0g `  H )  =  [  .0.  ] ( G ~QG  S ) ) )
2317, 20, 22syl2anc 415 . . 3  |-  ( S  e.  (NrmSGrp `  G
)  ->  ( ( [  .0.  ] ( G ~QG  S ) ( +g  `  H
) [  .0.  ]
( G ~QG  S ) )  =  [  .0.  ] ( G ~QG  S )  <->  ( 0g `  H )  =  [  .0.  ] ( G ~QG  S ) ) )
2416, 23mpbid 147 . 2  |-  ( S  e.  (NrmSGrp `  G
)  ->  ( 0g `  H )  =  [  .0.  ] ( G ~QG  S ) )
2524eqcomd 2244 1  |-  ( S  e.  (NrmSGrp `  G
)  ->  [  .0.  ] ( G ~QG  S )  =  ( 0g `  H ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   ` cfv 5380  (class class class)co 6088   [cec 6809   Basecbs 13410   +g cplusg 13490   0gc0g 13669    /.s cqus 13682   Grpcgrp 13864  SubGrpcsubg 14029  NrmSGrpcnsg 14030   ~QG cqg 14031
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-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3or 1010  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-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-er 6811  df-ec 6813  df-qs 6817  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-mulr 13504  df-0g 13671  df-iimas 13683  df-qus 13684  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-subg 14032  df-nsg 14033  df-eqg 14034
This theorem is used by:  qusinv  14098
  Copyright terms: Public domain W3C validator