Theorem brinxp2 4786

Description: Intersection of binary relation with Cartesian product. (Contributed by NM, 3-Mar-2007.) (Revised by Mario Carneiro, 26-Apr-2015.)

Assertion

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

Proof of Theorem brinxp2

Step	Hyp	Ref	Expression
1		brin 4136	. 2 |- ( A ( R i^i ( C X. D ) ) B <-> ( A R B /\ A ( C X. D ) B ) )
2		ancom 266	. 2 |- ( ( A R B /\ A ( C X. D ) B ) <-> ( A ( C X. D ) B /\ A R B ) )
3		brxp 4750	. . . 4 |- ( A ( C X. D ) B <-> ( A e. C /\ B e. D ) )
4	3	anbi1i 458	. . 3 |- ( ( A ( C X. D ) B /\ A R B ) <-> ( ( A e. C /\ B e. D ) /\ A R B ) )
5		df-3an 1004	. . 3 |- ( ( A e. C /\ B e. D /\ A R B ) <-> ( ( A e. C /\ B e. D ) /\ A R B ) )
6	4, 5	bitr4i 187	. 2 |- ( ( A ( C X. D ) B /\ A R B ) <-> ( A e. C /\ B e. D /\ A R B ) )
7	1, 2, 6	3bitri 206	1 |- ( A ( R i^i ( C X. D ) ) B <-> ( A e. C /\ B e. D /\ A R B ) )

Syntax hints:   /\ wa 104   <-> wb 105   /\ w3a 1002   e. wcel 2200   i^i cin 3196   class class class wbr 4083   X. cxp 4717

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-xp 4725

This theorem is referenced by:  brinxp  4787  fncnv  5387  erinxp  6756  isstructim  13046  isstructr  13047