Theorem releqgg 13671

Description: The left coset equivalence relation is a relation. (Contributed by Mario Carneiro, 14-Jun-2015.)

Hypothesis

Ref	Expression
releqg.r	|- R = ( G ~QG S )

Assertion

Ref	Expression
releqgg	|- ( ( G e. V /\ S e. W ) -> Rel R )

Proof of Theorem releqgg

Dummy variables i r x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relopab 4822	. 2 |- Rel { <. x , y >. | ( { x , y } C_ ( Base ` G ) /\ ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) }
2		releqg.r	. . . 4 |- R = ( G ~QG S )
3		elex 2788	. . . . . 6 |- ( G e. V -> G e. _V )
4	3	adantr 276	. . . . 5 |- ( ( G e. V /\ S e. W ) -> G e. _V )
5		elex 2788	. . . . . 6 |- ( S e. W -> S e. _V )
6	5	adantl 277	. . . . 5 |- ( ( G e. V /\ S e. W ) -> S e. _V )
7		vex 2779	. . . . . . . . 9 |- x e. _V
8		vex 2779	. . . . . . . . 9 |- y e. _V
9	7, 8	prss 3800	. . . . . . . 8 |- ( ( x e. ( Base ` G ) /\ y e. ( Base ` G ) ) <-> { x , y } C_ ( Base ` G ) )
10	9	anbi1i 458	. . . . . . 7 |- ( ( ( 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 ) )
11	10	opabbii 4127	. . . . . 6 |- { <. 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 ) }
12		basfn 13005	. . . . . . . . 9 |- Base Fn _V
13		funfvex 5616	. . . . . . . . . 10 |- ( ( Fun Base /\ G e. dom Base ) -> ( Base ` G ) e. _V )
14	13	funfni 5395	. . . . . . . . 9 |- ( ( Base Fn _V /\ G e. _V ) -> ( Base ` G ) e. _V )
15	12, 4, 14	sylancr 414	. . . . . . . 8 |- ( ( G e. V /\ S e. W ) -> ( Base ` G ) e. _V )
16		xpexg 4807	. . . . . . . 8 |- ( ( ( Base ` G ) e. _V /\ ( Base ` G ) e. _V ) -> ( ( Base ` G ) X. ( Base ` G ) ) e. _V )
17	15, 15, 16	syl2anc 411	. . . . . . 7 |- ( ( G e. V /\ S e. W ) -> ( ( Base ` G ) X. ( Base ` G ) ) e. _V )
18		opabssxp 4767	. . . . . . . 8 |- { <. x , y >. | ( ( x e. ( Base ` G ) /\ y e. ( Base ` G ) ) /\ ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) } C_ ( ( Base ` G ) X. ( Base ` G ) )
19	18	a1i 9	. . . . . . 7 |- ( ( 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 ) ) )
20	17, 19	ssexd 4200	. . . . . 6 |- ( ( 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 )
21	11, 20	eqeltrrid 2295	. . . . 5 |- ( ( G e. V /\ S e. W ) -> { <. x , y >. | ( { x , y } C_ ( Base ` G ) /\ ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) } e. _V )
22		fveq2 5599	. . . . . . . . 9 |- ( r = G -> ( Base ` r ) = ( Base ` G ) )
23	22	sseq2d 3231	. . . . . . . 8 |- ( r = G -> ( { x , y } C_ ( Base ` r ) <-> { x , y } C_ ( Base ` G ) ) )
24		fveq2 5599	. . . . . . . . . 10 |- ( r = G -> ( +g ` r ) = ( +g ` G ) )
25		fveq2 5599	. . . . . . . . . . 11 |- ( r = G -> ( invg ` r ) = ( invg ` G ) )
26	25	fveq1d 5601	. . . . . . . . . 10 |- ( r = G -> ( ( invg ` r ) ` x ) = ( ( invg ` G ) ` x ) )
27		eqidd 2208	. . . . . . . . . 10 |- ( r = G -> y = y )
28	24, 26, 27	oveq123d 5988	. . . . . . . . 9 |- ( r = G -> ( ( ( invg ` r ) ` x ) ( +g ` r ) y ) = ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) )
29	28	eleq1d 2276	. . . . . . . 8 |- ( r = G -> ( ( ( ( invg ` r ) ` x ) ( +g ` r ) y ) e. i <-> ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. i ) )
30	23, 29	anbi12d 473	. . . . . . 7 |- ( 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 ) ) )
31	30	opabbidv 4126	. . . . . 6 |- ( 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 ) } )
32		eleq2 2271	. . . . . . . 8 |- ( i = S -> ( ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. i <-> ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) )
33	32	anbi2d 464	. . . . . . 7 |- ( 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 ) ) )
34	33	opabbidv 4126	. . . . . 6 |- ( 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 ) } )
35		df-eqg 13623	. . . . . 6 |- ~QG = ( r e. _V , i e. _V |-> { <. x , y >. | ( { x , y } C_ ( Base ` r ) /\ ( ( ( invg ` r ) ` x ) ( +g ` r ) y ) e. i ) } )
36	31, 34, 35	ovmpog 6103	. . . . 5 |- ( ( 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 ) } )
37	4, 6, 21, 36	syl3anc 1250	. . . 4 |- ( ( G e. V /\ S e. W ) -> ( G ~QG S ) = { <. x , y >. | ( { x , y } C_ ( Base ` G ) /\ ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) } )
38	2, 37	eqtrid 2252	. . 3 |- ( ( G e. V /\ S e. W ) -> R = { <. x , y >. | ( { x , y } C_ ( Base ` G ) /\ ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) } )
39	38	releqd 4777	. 2 |- ( ( G e. V /\ S e. W ) -> ( Rel R <-> Rel { <. x , y >. | ( { x , y } C_ ( Base ` G ) /\ ( ( ( invg ` G ) ` x ) ( +g ` G ) y ) e. S ) } ) )
40	1, 39	mpbiri 168	1 |- ( ( G e. V /\ S e. W ) -> Rel R )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1373   e. wcel 2178   _Vcvv 2776   C_ wss 3174   {cpr 3644   {copab 4120   X. cxp 4691   Rel wrel 4698   Fn wfn 5285   ` cfv 5290  (class class class)co 5967   Basecbs 12947   +g cplusg 13024   invgcminusg 13448   ~_QG cqg 13620

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1re 8054  ax-addrcl 8057

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-iota 5251  df-fun 5292  df-fn 5293  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-inn 9072  df-ndx 12950  df-slot 12951  df-base 12953  df-eqg 13623

This theorem is referenced by:  eqger  13675  eqgid  13677