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

Theorem quseccl0g 14011
Description: Closure of the quotient map for a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) Generalization of quseccl 14013 for arbitrary sets  G. (Revised by AV, 24-Feb-2025.)
Hypotheses
Ref Expression
quseccl0.e  |-  .~  =  ( G ~QG  S )
quseccl0.h  |-  H  =  ( G  /.s  .~  )
quseccl0.c  |-  C  =  ( Base `  G
)
quseccl0.b  |-  B  =  ( Base `  H
)
Assertion
Ref Expression
quseccl0g  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  [ X ]  .~  e.  B )

Proof of Theorem quseccl0g
StepHypRef Expression
1 quseccl0.e . . . 4  |-  .~  =  ( G ~QG  S )
2 eqgex 14001 . . . . 5  |-  ( ( G  e.  V  /\  S  e.  Z )  ->  ( G ~QG  S )  e.  _V )
323adant2 1047 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  ( G ~QG  S )  e.  _V )
41, 3eqeltrid 2325 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  .~  e.  _V )
5 simp2 1029 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  X  e.  C )
6 ecelqsg 6852 . . 3  |-  ( (  .~  e.  _V  /\  X  e.  C )  ->  [ X ]  .~  e.  ( C /.  .~  ) )
74, 5, 6syl2anc 415 . 2  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  [ X ]  .~  e.  ( C /.  .~  ) )
8 quseccl0.h . . . . 5  |-  H  =  ( G  /.s  .~  )
98a1i 9 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  H  =  ( G 
/.s  .~  ) )
10 quseccl0.c . . . . 5  |-  C  =  ( Base `  G
)
1110a1i 9 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  C  =  ( Base `  G ) )
12 simp1 1028 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  G  e.  V )
139, 11, 4, 12qusbas 13625 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  ( C /.  .~  )  =  ( Base `  H ) )
14 quseccl0.b . . 3  |-  B  =  ( Base `  H
)
1513, 14eqtr4di 2289 . 2  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  ( C /.  .~  )  =  B )
167, 15eleqtrd 2317 1  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  [ X ]  .~  e.  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209   _Vcvv 2821   ` cfv 5372  (class class class)co 6075   [cec 6795   /.cqs 6796   Basecbs 13330    /.s cqus 13600   ~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-lttrn 8283  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-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-tp 3713  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-ov 6078  df-oprab 6079  df-mpo 6080  df-ec 6799  df-qs 6803  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-mulr 13422  df-iimas 13601  df-qus 13602  df-eqg 13952
This theorem is referenced by:  quseccl  14013  ecqusaddcl  14019
  Copyright terms: Public domain W3C validator