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

Theorem quseccl0g 13881
Description: Closure of the quotient map for a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) Generalization of quseccl 13883 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 13871 . . . . 5  |-  ( ( G  e.  V  /\  S  e.  Z )  ->  ( G ~QG  S )  e.  _V )
323adant2 1043 . . . 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 1025 . . 3  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  X  e.  C )
6 ecelqsg 6800 . . 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 1024 . . . 4  |-  ( ( G  e.  V  /\  X  e.  C  /\  S  e.  Z )  ->  G  e.  V )
139, 11, 4, 12qusbas 13473 . . 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 1005    = wceq 1398    e. wcel 2202   _Vcvv 2803   ` cfv 5333  (class class class)co 6028   [cec 6743   /.cqs 6744   Basecbs 13145    /.s cqus 13446   ~QG cqg 13819
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-tp 3681  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-ec 6747  df-qs 6751  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-mulr 13237  df-iimas 13448  df-qus 13449  df-eqg 13822
This theorem is referenced by:  quseccl  13883  ecqusaddcl  13889
  Copyright terms: Public domain W3C validator