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

Theorem eqg0el 14009
Description: Equivalence class of a quotient group for a subgroup. (Contributed by Thierry Arnoux, 15-Jan-2024.)
Hypothesis
Ref Expression
eqg0el.1  |-  .~  =  ( G ~QG  H )
Assertion
Ref Expression
eqg0el  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( [ X ]  .~  =  H 
<->  X  e.  H ) )

Proof of Theorem eqg0el
StepHypRef Expression
1 eqid 2238 . . . . . 6  |-  ( Base `  G )  =  (
Base `  G )
2 eqg0el.1 . . . . . 6  |-  .~  =  ( G ~QG  H )
31, 2eqger 14004 . . . . 5  |-  ( H  e.  (SubGrp `  G
)  ->  .~  Er  ( Base `  G ) )
43adantl 277 . . . 4  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  .~  Er  ( Base `  G )
)
5 eqid 2238 . . . . . 6  |-  ( 0g
`  G )  =  ( 0g `  G
)
61, 5grpidcl 13811 . . . . 5  |-  ( G  e.  Grp  ->  ( 0g `  G )  e.  ( Base `  G
) )
76adantr 276 . . . 4  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( 0g `  G )  e.  ( Base `  G
) )
84, 7erth 6843 . . 3  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  (
( 0g `  G
)  .~  X  <->  [ ( 0g `  G ) ]  .~  =  [ X ]  .~  ) )
91, 2, 5eqgid 14006 . . . . 5  |-  ( H  e.  (SubGrp `  G
)  ->  [ ( 0g `  G ) ]  .~  =  H )
109adantl 277 . . . 4  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  [ ( 0g `  G ) ]  .~  =  H )
1110eqeq1d 2247 . . 3  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( [ ( 0g `  G ) ]  .~  =  [ X ]  .~  <->  H  =  [ X ]  .~  ) )
12 eqcom 2240 . . . 4  |-  ( H  =  [ X ]  .~ 
<->  [ X ]  .~  =  H )
1312a1i 9 . . 3  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( H  =  [ X ]  .~  <->  [ X ]  .~  =  H ) )
148, 11, 133bitrrd 215 . 2  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( [ X ]  .~  =  H 
<->  ( 0g `  G
)  .~  X )
)
15 errel 6806 . . . 4  |-  (  .~  Er  ( Base `  G
)  ->  Rel  .~  )
16 relelec 6839 . . . 4  |-  ( Rel 
.~  ->  ( X  e. 
[ ( 0g `  G ) ]  .~  <->  ( 0g `  G )  .~  X ) )
173, 15, 163syl 17 . . 3  |-  ( H  e.  (SubGrp `  G
)  ->  ( X  e.  [ ( 0g `  G ) ]  .~  <->  ( 0g `  G )  .~  X ) )
1817adantl 277 . 2  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( X  e.  [ ( 0g `  G ) ]  .~  <->  ( 0g `  G )  .~  X
) )
1910eleq2d 2308 . 2  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( X  e.  [ ( 0g `  G ) ]  .~  <->  X  e.  H
) )
2014, 18, 193bitr2d 216 1  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  ( [ X ]  .~  =  H 
<->  X  e.  H ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4125   Rel wrel 4774   ` cfv 5372  (class class class)co 6075    Er wer 6794   [cec 6795   Basecbs 13330   0gc0g 13587   Grpcgrp 13782  SubGrpcsubg 13947   ~QG cqg 13949
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 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 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-ltadd 8285
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-er 6797  df-ec 6799  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786  df-subg 13950  df-eqg 13952
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator