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

Theorem eqg0el 14032
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 14027 . . . . 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 13834 . . . . 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 6853 . . 3  |-  ( ( G  e.  Grp  /\  H  e.  (SubGrp `  G
) )  ->  (
( 0g `  G
)  .~  X  <->  [ ( 0g `  G ) ]  .~  =  [ X ]  .~  ) )
91, 2, 5eqgid 14029 . . . . 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 6816 . . . 4  |-  (  .~  Er  ( Base `  G
)  ->  Rel  .~  )
16 relelec 6849 . . . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4130   Rel wrel 4779   ` cfv 5377  (class class class)co 6085    Er wer 6804   [cec 6805   Basecbs 13352   0gc0g 13610   Grpcgrp 13805  SubGrpcsubg 13970   ~QG cqg 13972
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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295
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-iun 4014  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-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-er 6807  df-ec 6809  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-subg 13973  df-eqg 13975
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator