Theorem brab2ga 4801

Description: The law of concretion for a binary relation. See brab2a 4779 for alternate proof. TODO: should one of them be deleted? (Contributed by Mario Carneiro, 28-Apr-2015.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
brab2ga.1	|- ( ( x = A /\ y = B ) -> ( ph <-> ps ) )
brab2ga.2	|- R = { <. x , y >. | ( ( x e. C /\ y e. D ) /\ ph ) }

Assertion

Ref	Expression
brab2ga	|- ( A R B <-> ( ( A e. C /\ B e. D ) /\ ps ) )

Distinct variable groups:   x, y, A   x, B, y   x, C, y   x, D, y   ps, x, y

Allowed substitution hints:   ph( x, y)   R( x, y)

Proof of Theorem brab2ga

Step	Hyp	Ref	Expression
1		brab2ga.2	. . . 4 |- R = { <. x , y >. | ( ( x e. C /\ y e. D ) /\ ph ) }
2		opabssxp 4800	. . . 4 |- { <. x , y >. | ( ( x e. C /\ y e. D ) /\ ph ) } C_ ( C X. D )
3	1, 2	eqsstri 3259	. . 3 |- R C_ ( C X. D )
4	3	brel 4778	. 2 |- ( A R B -> ( A e. C /\ B e. D ) )
5		df-br 4089	. . . 4 |- ( A R B <-> <. A , B >. e. R )
6	1	eleq2i 2298	. . . 4 |- ( <. A , B >. e. R <-> <. A , B >. e. { <. x , y >. | ( ( x e. C /\ y e. D ) /\ ph ) } )
7	5, 6	bitri 184	. . 3 |- ( A R B <-> <. A , B >. e. { <. x , y >. | ( ( x e. C /\ y e. D ) /\ ph ) } )
8		brab2ga.1	. . . 4 |- ( ( x = A /\ y = B ) -> ( ph <-> ps ) )
9	8	opelopab2a 4359	. . 3 |- ( ( A e. C /\ B e. D ) -> ( <. A , B >. e. { <. x , y >. | ( ( x e. C /\ y e. D ) /\ ph ) } <-> ps ) )
10	7, 9	bitrid 192	. 2 |- ( ( A e. C /\ B e. D ) -> ( A R B <-> ps ) )
11	4, 10	biadan2 456	1 |- ( A R B <-> ( ( A e. C /\ B e. D ) /\ ps ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1397   e. wcel 2202   <.cop 3672   class class class wbr 4088   {copab 4149   X. cxp 4723

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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731

This theorem is referenced by:  reapval  8755  ltxr  10009