Theorem eqgval 14026

Description: Value of the subgroup left coset equivalence relation. (Contributed by Mario Carneiro, 15-Jan-2015.) (Revised by Mario Carneiro, 14-Jun-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
eqgval	|- ( ( G e. V /\ S C_ X ) -> ( A R B <-> ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) )

Proof of Theorem eqgval

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

Step	Hyp	Ref	Expression
1		eqgval.x	. . . 4 |- X = ( Base ` G )
2		eqgval.n	. . . 4 |- N = ( invg ` G )
3		eqgval.p	. . . 4 |- .+ = ( +g ` G )
4		eqgval.r	. . . 4 |- R = ( G ~QG S )
5	1, 2, 3, 4	eqgfval 14025	. . 3 |- ( ( G e. V /\ S C_ X ) -> R = { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } )
6	5	breqd 4141	. 2 |- ( ( G e. V /\ S C_ X ) -> ( A R B <-> A { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } B ) )
7		brabv 4907	. . . 4 |- ( A { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } B -> ( A e. _V /\ B e. _V ) )
8	7	adantl 277	. . 3 |- ( ( ( G e. V /\ S C_ X ) /\ A { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } B ) -> ( A e. _V /\ B e. _V ) )
9		simpr1 1034	. . . . 5 |- ( ( ( G e. V /\ S C_ X ) /\ ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) -> A e. X )
10	9	elexd 2835	. . . 4 |- ( ( ( G e. V /\ S C_ X ) /\ ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) -> A e. _V )
11		simpr2 1035	. . . . 5 |- ( ( ( G e. V /\ S C_ X ) /\ ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) -> B e. X )
12	11	elexd 2835	. . . 4 |- ( ( ( G e. V /\ S C_ X ) /\ ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) -> B e. _V )
13	10, 12	jca 306	. . 3 |- ( ( ( G e. V /\ S C_ X ) /\ ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) -> ( A e. _V /\ B e. _V ) )
14		vex 2824	. . . . . . . 8 |- x e. _V
15		vex 2824	. . . . . . . 8 |- y e. _V
16	14, 15	prss 3871	. . . . . . 7 |- ( ( x e. X /\ y e. X ) <-> { x , y } C_ X )
17		eleq1 2301	. . . . . . . 8 |- ( x = A -> ( x e. X <-> A e. X ) )
18		eleq1 2301	. . . . . . . 8 |- ( y = B -> ( y e. X <-> B e. X ) )
19	17, 18	bi2anan9 614	. . . . . . 7 |- ( ( x = A /\ y = B ) -> ( ( x e. X /\ y e. X ) <-> ( A e. X /\ B e. X ) ) )
20	16, 19	bitr3id 194	. . . . . 6 |- ( ( x = A /\ y = B ) -> ( { x , y } C_ X <-> ( A e. X /\ B e. X ) ) )
21		fveq2 5695	. . . . . . . 8 |- ( x = A -> ( N ` x ) = ( N ` A ) )
22		id 19	. . . . . . . 8 |- ( y = B -> y = B )
23	21, 22	oveqan12d 6104	. . . . . . 7 |- ( ( x = A /\ y = B ) -> ( ( N ` x ) .+ y ) = ( ( N ` A ) .+ B ) )
24	23	eleq1d 2307	. . . . . 6 |- ( ( x = A /\ y = B ) -> ( ( ( N ` x ) .+ y ) e. S <-> ( ( N ` A ) .+ B ) e. S ) )
25	20, 24	anbi12d 477	. . . . 5 |- ( ( x = A /\ y = B ) -> ( ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) <-> ( ( A e. X /\ B e. X ) /\ ( ( N ` A ) .+ B ) e. S ) ) )
26		df-3an 1011	. . . . 5 |- ( ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) <-> ( ( A e. X /\ B e. X ) /\ ( ( N ` A ) .+ B ) e. S ) )
27	25, 26	bitr4di 198	. . . 4 |- ( ( x = A /\ y = B ) -> ( ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) <-> ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) )
28		eqid 2238	. . . 4 |- { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } = { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) }
29	27, 28	brabga 4406	. . 3 |- ( ( A e. _V /\ B e. _V ) -> ( A { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } B <-> ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) )
30	8, 13, 29	pm5.21nd 928	. 2 |- ( ( G e. V /\ S C_ X ) -> ( A { <. x , y >. | ( { x , y } C_ X /\ ( ( N ` x ) .+ y ) e. S ) } B <-> ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) )
31	6, 30	bitrd 188	1 |- ( ( G e. V /\ S C_ X ) -> ( A R B <-> ( A e. X /\ B e. X /\ ( ( N ` A ) .+ B ) e. S ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   {cpr 3710   class class class wbr 4130   {copab 4191   ` 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:  eqger  14027  eqglact  14028  eqgid  14029  eqgcpbl  14031  eqgabl  14134