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

Theorem eqgex 14024
Description: The left coset equivalence relation exists. (Contributed by Jim Kingdon, 25-Apr-2025.)
Assertion
Ref Expression
eqgex  |-  ( ( G  e.  V  /\  S  e.  W )  ->  ( G ~QG  S )  e.  _V )

Proof of Theorem eqgex
Dummy variables  i  r  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . . 4  |-  ( G  e.  V  ->  G  e.  _V )
21adantr 276 . . 3  |-  ( ( G  e.  V  /\  S  e.  W )  ->  G  e.  _V )
3 elex 2833 . . . 4  |-  ( S  e.  W  ->  S  e.  _V )
43adantl 277 . . 3  |-  ( ( G  e.  V  /\  S  e.  W )  ->  S  e.  _V )
5 vex 2824 . . . . . . 7  |-  x  e. 
_V
6 vex 2824 . . . . . . 7  |-  y  e. 
_V
75, 6prss 3871 . . . . . 6  |-  ( ( x  e.  ( Base `  G )  /\  y  e.  ( Base `  G
) )  <->  { x ,  y }  C_  ( Base `  G )
)
87anbi1i 462 . . . . 5  |-  ( ( ( x  e.  (
Base `  G )  /\  y  e.  ( Base `  G ) )  /\  ( ( ( invg `  G
) `  x )
( +g  `  G ) y )  e.  S
)  <->  ( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  S
) )
98opabbii 4198 . . . 4  |-  { <. x ,  y >.  |  ( ( x  e.  (
Base `  G )  /\  y  e.  ( Base `  G ) )  /\  ( ( ( invg `  G
) `  x )
( +g  `  G ) y )  e.  S
) }  =  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  S
) }
10 basfn 13411 . . . . . . 7  |-  Base  Fn  _V
11 funfvex 5712 . . . . . . . 8  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
1211funfni 5483 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  G  e.  _V )  ->  ( Base `  G )  e. 
_V )
1310, 2, 12sylancr 418 . . . . . 6  |-  ( ( G  e.  V  /\  S  e.  W )  ->  ( Base `  G
)  e.  _V )
14 xpexg 4889 . . . . . 6  |-  ( ( ( Base `  G
)  e.  _V  /\  ( Base `  G )  e.  _V )  ->  (
( Base `  G )  X.  ( Base `  G
) )  e.  _V )
1513, 13, 14syl2anc 415 . . . . 5  |-  ( ( G  e.  V  /\  S  e.  W )  ->  ( ( Base `  G
)  X.  ( Base `  G ) )  e. 
_V )
16 opabssxp 4849 . . . . . 6  |-  { <. x ,  y >.  |  ( ( x  e.  (
Base `  G )  /\  y  e.  ( Base `  G ) )  /\  ( ( ( invg `  G
) `  x )
( +g  `  G ) y )  e.  S
) }  C_  (
( Base `  G )  X.  ( Base `  G
) )
1716a1i 9 . . . . 5  |-  ( ( G  e.  V  /\  S  e.  W )  ->  { <. x ,  y
>.  |  ( (
x  e.  ( Base `  G )  /\  y  e.  ( Base `  G
) )  /\  (
( ( invg `  G ) `  x
) ( +g  `  G
) y )  e.  S ) }  C_  ( ( Base `  G
)  X.  ( Base `  G ) ) )
1815, 17ssexd 4273 . . . 4  |-  ( ( G  e.  V  /\  S  e.  W )  ->  { <. x ,  y
>.  |  ( (
x  e.  ( Base `  G )  /\  y  e.  ( Base `  G
) )  /\  (
( ( invg `  G ) `  x
) ( +g  `  G
) y )  e.  S ) }  e.  _V )
199, 18eqeltrrid 2326 . . 3  |-  ( ( G  e.  V  /\  S  e.  W )  ->  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  ( Base `  G
)  /\  ( (
( invg `  G ) `  x
) ( +g  `  G
) y )  e.  S ) }  e.  _V )
20 fveq2 5695 . . . . . . 7  |-  ( r  =  G  ->  ( Base `  r )  =  ( Base `  G
) )
2120sseq2d 3278 . . . . . 6  |-  ( r  =  G  ->  ( { x ,  y }  C_  ( Base `  r )  <->  { x ,  y }  C_  ( Base `  G )
) )
22 fveq2 5695 . . . . . . . 8  |-  ( r  =  G  ->  ( +g  `  r )  =  ( +g  `  G
) )
23 fveq2 5695 . . . . . . . . 9  |-  ( r  =  G  ->  ( invg `  r )  =  ( invg `  G ) )
2423fveq1d 5697 . . . . . . . 8  |-  ( r  =  G  ->  (
( invg `  r ) `  x
)  =  ( ( invg `  G
) `  x )
)
25 eqidd 2239 . . . . . . . 8  |-  ( r  =  G  ->  y  =  y )
2622, 24, 25oveq123d 6106 . . . . . . 7  |-  ( r  =  G  ->  (
( ( invg `  r ) `  x
) ( +g  `  r
) y )  =  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y ) )
2726eleq1d 2307 . . . . . 6  |-  ( r  =  G  ->  (
( ( ( invg `  r ) `
 x ) ( +g  `  r ) y )  e.  i  <-> 
( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  i ) )
2821, 27anbi12d 477 . . . . 5  |-  ( r  =  G  ->  (
( { x ,  y }  C_  ( Base `  r )  /\  ( ( ( invg `  r ) `
 x ) ( +g  `  r ) y )  e.  i )  <->  ( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  i ) ) )
2928opabbidv 4197 . . . 4  |-  ( r  =  G  ->  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  r )  /\  (
( ( invg `  r ) `  x
) ( +g  `  r
) y )  e.  i ) }  =  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  ( Base `  G
)  /\  ( (
( invg `  G ) `  x
) ( +g  `  G
) y )  e.  i ) } )
30 eleq2 2302 . . . . . 6  |-  ( i  =  S  ->  (
( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  i  <-> 
( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  S
) )
3130anbi2d 468 . . . . 5  |-  ( i  =  S  ->  (
( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  i )  <->  ( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  S
) ) )
3231opabbidv 4197 . . . 4  |-  ( i  =  S  ->  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  G )  /\  (
( ( invg `  G ) `  x
) ( +g  `  G
) y )  e.  i ) }  =  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  ( Base `  G
)  /\  ( (
( invg `  G ) `  x
) ( +g  `  G
) y )  e.  S ) } )
33 df-eqg 13975 . . . 4  |- ~QG  =  ( r  e.  _V ,  i  e. 
_V  |->  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  r )  /\  (
( ( invg `  r ) `  x
) ( +g  `  r
) y )  e.  i ) } )
3429, 32, 33ovmpog 6223 . . 3  |-  ( ( G  e.  _V  /\  S  e.  _V  /\  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  S
) }  e.  _V )  ->  ( G ~QG  S )  =  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  G )  /\  (
( ( invg `  G ) `  x
) ( +g  `  G
) y )  e.  S ) } )
352, 4, 19, 34syl3anc 1278 . 2  |-  ( ( G  e.  V  /\  S  e.  W )  ->  ( G ~QG  S )  =  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  G )  /\  ( ( ( invg `  G ) `
 x ) ( +g  `  G ) y )  e.  S
) } )
3635, 19eqeltrd 2315 1  |-  ( ( G  e.  V  /\  S  e.  W )  ->  ( G ~QG  S )  e.  _V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    C_ wss 3220   {cpr 3710   {copab 4191    X. cxp 4772    Fn wfn 5372   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   invgcminusg 13806   ~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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
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-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  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-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-eqg 13975
This theorem is used by:  quselbasg  14033  quseccl0g  14034  qusghm  14085  quscrng  14870  znval  14971  znle  14972  znbaslemnn  14974  znbas  14979  znzrhval  14982  znzrhfo  14983
  Copyright terms: Public domain W3C validator