Theorem brab 4998

Description: The law of concretion for a binary relation. (Contributed by NM, 16-Aug-1999.)

Hypotheses

Ref	Expression
opelopab.1	|- A e. _V
opelopab.2	|- B e. _V
opelopab.3	|- ( x = A -> ( ph <-> ps ) )
opelopab.4	|- ( y = B -> ( ps <-> ch ) )
brab.5	|- R = { <. x , y >. | ph }

Assertion

Ref	Expression
brab	|- ( A R B <-> ch )

Distinct variable groups:   x, y, A   x, B, y   ch, x, y

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

Proof of Theorem brab

Step	Hyp	Ref	Expression
1		opelopab.1	. 2 |- A e. _V
2		opelopab.2	. 2 |- B e. _V
3		opelopab.3	. . 3 |- ( x = A -> ( ph <-> ps ) )
4		opelopab.4	. . 3 |- ( y = B -> ( ps <-> ch ) )
5		brab.5	. . 3 |- R = { <. x , y >. | ph }
6	3, 4, 5	brabg 4994	. 2 |- ( ( A e. _V /\ B e. _V ) -> ( A R B <-> ch ) )
7	1, 2, 6	mp2an 708	1 |- ( A R B <-> ch )

Syntax hints:   -> wi 4   <-> wb 196   = wceq 1483   e. wcel 1990   _Vcvv 3200   class class class wbr 4653   {copab 4712

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713

This theorem is referenced by:  opbrop  5198  f1oweALT  7152  frxp  7287  fnwelem  7292  dftpos4  7371  dfac3  8944  axdc2lem  9270  brdom7disj  9353  brdom6disj  9354  ordpipq  9764  ltresr  9961  shftfn  13813  2shfti  13820  ishpg  25651  brcgr  25780  ex-opab  27289  br8d  29422  br8  31646  br6  31647  br4  31648  poseq  31750  dfbigcup2  32006  brsegle  32215  heiborlem2  33611