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

Theorem eqgfval 13889
Description: Value of the subgroup left coset equivalence relation. (Contributed by Mario Carneiro, 15-Jan-2015.)
Hypotheses
Ref Expression
eqgval.x  |-  X  =  ( Base `  G
)
eqgval.n  |-  N  =  ( invg `  G )
eqgval.p  |-  .+  =  ( +g  `  G )
eqgval.r  |-  R  =  ( G ~QG  S )
Assertion
Ref Expression
eqgfval  |-  ( ( G  e.  V  /\  S  C_  X )  ->  R  =  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S ) } )
Distinct variable groups:    x, y, G   
x, N, y    x, S, y    x,  .+ , y    x, X, y
Allowed substitution hints:    R( x, y)    V( x, y)

Proof of Theorem eqgfval
Dummy variables  g  s are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqgval.r . 2  |-  R  =  ( G ~QG  S )
2 elex 2815 . . . 4  |-  ( G  e.  V  ->  G  e.  _V )
32adantr 276 . . 3  |-  ( ( G  e.  V  /\  S  C_  X )  ->  G  e.  _V )
4 eqgval.x . . . . . 6  |-  X  =  ( Base `  G
)
5 basfn 13221 . . . . . . 7  |-  Base  Fn  _V
6 funfvex 5665 . . . . . . . 8  |-  ( ( Fun  Base  /\  G  e. 
dom  Base )  ->  ( Base `  G )  e. 
_V )
76funfni 5439 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  G  e.  _V )  ->  ( Base `  G )  e. 
_V )
85, 2, 7sylancr 414 . . . . . 6  |-  ( G  e.  V  ->  ( Base `  G )  e. 
_V )
94, 8eqeltrid 2318 . . . . 5  |-  ( G  e.  V  ->  X  e.  _V )
109adantr 276 . . . 4  |-  ( ( G  e.  V  /\  S  C_  X )  ->  X  e.  _V )
11 simpr 110 . . . 4  |-  ( ( G  e.  V  /\  S  C_  X )  ->  S  C_  X )
1210, 11ssexd 4234 . . 3  |-  ( ( G  e.  V  /\  S  C_  X )  ->  S  e.  _V )
13 xpexg 4846 . . . . 5  |-  ( ( X  e.  _V  /\  X  e.  _V )  ->  ( X  X.  X
)  e.  _V )
1410, 10, 13syl2anc 411 . . . 4  |-  ( ( G  e.  V  /\  S  C_  X )  -> 
( X  X.  X
)  e.  _V )
15 simpl 109 . . . . . . . 8  |-  ( ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S )  ->  { x ,  y }  C_  X
)
16 vex 2806 . . . . . . . . 9  |-  x  e. 
_V
17 vex 2806 . . . . . . . . 9  |-  y  e. 
_V
1816, 17prss 3834 . . . . . . . 8  |-  ( ( x  e.  X  /\  y  e.  X )  <->  { x ,  y } 
C_  X )
1915, 18sylibr 134 . . . . . . 7  |-  ( ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S )  ->  ( x  e.  X  /\  y  e.  X ) )
2019ssopab2i 4378 . . . . . 6  |-  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S ) }  C_  { <. x ,  y >.  |  ( x  e.  X  /\  y  e.  X ) }
21 df-xp 4737 . . . . . 6  |-  ( X  X.  X )  =  { <. x ,  y
>.  |  ( x  e.  X  /\  y  e.  X ) }
2220, 21sseqtrri 3263 . . . . 5  |-  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S ) }  C_  ( X  X.  X )
2322a1i 9 . . . 4  |-  ( ( G  e.  V  /\  S  C_  X )  ->  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  X  /\  (
( N `  x
)  .+  y )  e.  S ) }  C_  ( X  X.  X
) )
2414, 23ssexd 4234 . . 3  |-  ( ( G  e.  V  /\  S  C_  X )  ->  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  X  /\  (
( N `  x
)  .+  y )  e.  S ) }  e.  _V )
25 simpl 109 . . . . . . . . 9  |-  ( ( g  =  G  /\  s  =  S )  ->  g  =  G )
2625fveq2d 5652 . . . . . . . 8  |-  ( ( g  =  G  /\  s  =  S )  ->  ( Base `  g
)  =  ( Base `  G ) )
2726, 4eqtr4di 2282 . . . . . . 7  |-  ( ( g  =  G  /\  s  =  S )  ->  ( Base `  g
)  =  X )
2827sseq2d 3258 . . . . . 6  |-  ( ( g  =  G  /\  s  =  S )  ->  ( { x ,  y }  C_  ( Base `  g )  <->  { x ,  y }  C_  X ) )
2925fveq2d 5652 . . . . . . . . 9  |-  ( ( g  =  G  /\  s  =  S )  ->  ( +g  `  g
)  =  ( +g  `  G ) )
30 eqgval.p . . . . . . . . 9  |-  .+  =  ( +g  `  G )
3129, 30eqtr4di 2282 . . . . . . . 8  |-  ( ( g  =  G  /\  s  =  S )  ->  ( +g  `  g
)  =  .+  )
3225fveq2d 5652 . . . . . . . . . 10  |-  ( ( g  =  G  /\  s  =  S )  ->  ( invg `  g )  =  ( invg `  G
) )
33 eqgval.n . . . . . . . . . 10  |-  N  =  ( invg `  G )
3432, 33eqtr4di 2282 . . . . . . . . 9  |-  ( ( g  =  G  /\  s  =  S )  ->  ( invg `  g )  =  N )
3534fveq1d 5650 . . . . . . . 8  |-  ( ( g  =  G  /\  s  =  S )  ->  ( ( invg `  g ) `  x
)  =  ( N `
 x ) )
36 eqidd 2232 . . . . . . . 8  |-  ( ( g  =  G  /\  s  =  S )  ->  y  =  y )
3731, 35, 36oveq123d 6049 . . . . . . 7  |-  ( ( g  =  G  /\  s  =  S )  ->  ( ( ( invg `  g ) `
 x ) ( +g  `  g ) y )  =  ( ( N `  x
)  .+  y )
)
38 simpr 110 . . . . . . 7  |-  ( ( g  =  G  /\  s  =  S )  ->  s  =  S )
3937, 38eleq12d 2302 . . . . . 6  |-  ( ( g  =  G  /\  s  =  S )  ->  ( ( ( ( invg `  g
) `  x )
( +g  `  g ) y )  e.  s  <-> 
( ( N `  x )  .+  y
)  e.  S ) )
4028, 39anbi12d 473 . . . . 5  |-  ( ( g  =  G  /\  s  =  S )  ->  ( ( { x ,  y }  C_  ( Base `  g )  /\  ( ( ( invg `  g ) `
 x ) ( +g  `  g ) y )  e.  s )  <->  ( { x ,  y }  C_  X  /\  ( ( N `
 x )  .+  y )  e.  S
) ) )
4140opabbidv 4160 . . . 4  |-  ( ( g  =  G  /\  s  =  S )  ->  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  ( Base `  g
)  /\  ( (
( invg `  g ) `  x
) ( +g  `  g
) y )  e.  s ) }  =  { <. x ,  y
>.  |  ( {
x ,  y } 
C_  X  /\  (
( N `  x
)  .+  y )  e.  S ) } )
42 df-eqg 13839 . . . 4  |- ~QG  =  ( g  e.  _V ,  s  e. 
_V  |->  { <. x ,  y >.  |  ( { x ,  y }  C_  ( Base `  g )  /\  (
( ( invg `  g ) `  x
) ( +g  `  g
) y )  e.  s ) } )
4341, 42ovmpoga 6161 . . 3  |-  ( ( G  e.  _V  /\  S  e.  _V  /\  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `
 x )  .+  y )  e.  S
) }  e.  _V )  ->  ( G ~QG  S )  =  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S ) } )
443, 12, 24, 43syl3anc 1274 . 2  |-  ( ( G  e.  V  /\  S  C_  X )  -> 
( G ~QG  S )  =  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `
 x )  .+  y )  e.  S
) } )
451, 44eqtrid 2276 1  |-  ( ( G  e.  V  /\  S  C_  X )  ->  R  =  { <. x ,  y >.  |  ( { x ,  y }  C_  X  /\  ( ( N `  x )  .+  y
)  e.  S ) } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202   _Vcvv 2803    C_ wss 3201   {cpr 3674   {copab 4154    X. cxp 4729    Fn wfn 5328   ` cfv 5333  (class class class)co 6028   Basecbs 13162   +g cplusg 13240   invgcminusg 13664   ~QG cqg 13836
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-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
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-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  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-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9203  df-ndx 13165  df-slot 13166  df-base 13168  df-eqg 13839
This theorem is referenced by:  eqgval  13890
  Copyright terms: Public domain W3C validator