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

Theorem quseccl0g 13817
Description: Closure of the quotient map for a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) Generalization of quseccl 13819 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 13807 . . . . 5  |-  ( ( G  e.  V  /\  S  e.  Z )  ->  ( G ~QG  S )  e.  _V )
323adant2 1042 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  ( G ~QG  S )  e.  _V )
41, 3eqeltrid 2318 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  .~  e.  _V )
5 simp2 1024 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  X  e.  C )
6 ecelqsg 6756 . . 3  |-  ( (  .~  e.  _V  /\  X  e.  C )  ->  [ X ]  .~  e.  ( C /.  .~  ) )
74, 5, 6syl2anc 411 . 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 1023 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  G  e.  V )
139, 11, 4, 12qusbas 13409 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  ( C /.  .~  )  =  ( Base `  H ) )
14 quseccl0.b . . 3  |-  B  =  ( Base `  H
)
1513, 14eqtr4di 2282 . 2  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  ( C /.  .~  )  =  B )
167, 15eleqtrd 2310 1  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  [ X ]  .~  e.  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 1004    = wceq 1397    e. wcel 2202   _Vcvv 2802   ` cfv 5326  (class class class)co 6017   [cec 6699   /.cqs 6700   Basecbs 13081    /.s cqus 13382   ~QG cqg 13755
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-tp 3677  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-ec 6703  df-qs 6707  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-mulr 13173  df-iimas 13384  df-qus 13385  df-eqg 13758
This theorem is referenced by:  quseccl  13819  ecqusaddcl  13825
  Copyright terms: Public domain W3C validator