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

Theorem qus0 13308
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 13278 . . . . . . 7  |-  ( S  e.  (NrmSGrp `  G
)  ->  S  e.  (SubGrp `  G ) )
2 subgrcl 13252 . . . . . . 7  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
31, 2syl 14 . . . . . 6  |-  ( S  e.  (NrmSGrp `  G
)  ->  G  e.  Grp )
4 eqid 2193 . . . . . . 7  |-  ( Base `  G )  =  (
Base `  G )
5 qus0.p . . . . . . 7  |-  .0.  =  ( 0g `  G )
64, 5grpidcl 13104 . . . . . 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 2193 . . . . . 6  |-  ( +g  `  G )  =  ( +g  `  G )
10 eqid 2193 . . . . . 6  |-  ( +g  `  H )  =  ( +g  `  H )
118, 4, 9, 10qusadd 13307 . . . . 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 1350 . . . 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 13106 . . . . . 6  |-  ( ( G  e.  Grp  /\  .0.  e.  ( Base `  G
) )  ->  (  .0.  ( +g  `  G
)  .0.  )  =  .0.  )
143, 7, 13syl2anc 411 . . . . 5  |-  ( S  e.  (NrmSGrp `  G
)  ->  (  .0.  ( +g  `  G )  .0.  )  =  .0.  )
1514eceq1d 6625 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  [ (  .0.  ( +g  `  G
)  .0.  ) ] ( G ~QG  S )  =  [  .0.  ] ( G ~QG  S ) )
1612, 15eqtrd 2226 . . 3  |-  ( S  e.  (NrmSGrp `  G
)  ->  ( [  .0.  ] ( G ~QG  S ) ( +g  `  H
) [  .0.  ]
( G ~QG  S ) )  =  [  .0.  ] ( G ~QG  S ) )
178qusgrp 13305 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  H  e.  Grp )
18 eqid 2193 . . . . . 6  |-  ( Base `  H )  =  (
Base `  H )
198, 4, 18quseccl 13306 . . . . 5  |-  ( ( S  e.  (NrmSGrp `  G
)  /\  .0.  e.  ( Base `  G )
)  ->  [  .0.  ] ( G ~QG  S )  e.  (
Base `  H )
)
207, 19mpdan 421 . . . 4  |-  ( S  e.  (NrmSGrp `  G
)  ->  [  .0.  ] ( G ~QG  S )  e.  (
Base `  H )
)
21 eqid 2193 . . . . 5  |-  ( 0g
`  H )  =  ( 0g `  H
)
2218, 10, 21grpid 13114 . . . 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 411 . . 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 2199 1  |-  ( S  e.  (NrmSGrp `  G
)  ->  [  .0.  ] ( G ~QG  S )  =  ( 0g `  H ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1364    e. wcel 2164   ` cfv 5255  (class class class)co 5919   [cec 6587   Basecbs 12621   +g cplusg 12698   0gc0g 12870    /.s cqus 12886   Grpcgrp 13075  SubGrpcsubg 13240  NrmSGrpcnsg 13241   ~QG cqg 13242
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-lttrn 7988  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-tp 3627  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-er 6589  df-ec 6591  df-qs 6595  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-inn 8985  df-2 9043  df-3 9044  df-ndx 12624  df-slot 12625  df-base 12627  df-sets 12628  df-iress 12629  df-plusg 12711  df-mulr 12712  df-0g 12872  df-iimas 12888  df-qus 12889  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-grp 13078  df-minusg 13079  df-subg 13243  df-nsg 13244  df-eqg 13245
This theorem is referenced by:  qusinv  13309
  Copyright terms: Public domain W3C validator