Theorem brinxp 5181

Description: Intersection of binary relation with Cartesian product. (Contributed by NM, 9-Mar-1997.)

Assertion

Ref	Expression
brinxp	|- ( ( A e. C /\ B e. D ) -> ( A R B <-> A ( R i^i ( C X. D ) ) B ) )

Proof of Theorem brinxp

Step	Hyp	Ref	Expression
1		brinxp2 5180	. . 3 |- ( A ( R i^i ( C X. D ) ) B <-> ( A e. C /\ B e. D /\ A R B ) )
2		df-3an 1039	. . 3 |- ( ( A e. C /\ B e. D /\ A R B ) <-> ( ( A e. C /\ B e. D ) /\ A R B ) )
3	1, 2	bitri 264	. 2 |- ( A ( R i^i ( C X. D ) ) B <-> ( ( A e. C /\ B e. D ) /\ A R B ) )
4	3	baibr 945	1 |- ( ( A e. C /\ B e. D ) -> ( A R B <-> A ( R i^i ( C X. D ) ) B ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   /\ w3a 1037   e. wcel 1990   i^i cin 3573   class class class wbr 4653   X. cxp 5112

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-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  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  df-xp 5120

This theorem is referenced by:  poinxp  5182  soinxp  5183  frinxp  5184  seinxp  5185  exfo  6377  isores2  6583  ltpiord  9709  ordpinq  9765  pwsleval  16153  tsrss  17223  ordtrest  21006  ordtrest2lem  21007  ordtrestNEW  29967  ordtrest2NEWlem  29968