Theorem brinxp2 4837

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 4178	. 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 4800	. . . 4 |- ( A ( C X. D ) B <-> ( A e. C /\ B e. D ) )
4	3	anbi1i 462	. . 3 |- ( ( A ( C X. D ) B /\ A R B ) <-> ( ( A e. C /\ B e. D ) /\ A R B ) )
5		df-3an 1011	. . 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 1009   e. wcel 2209   i^i cin 3219   class class class wbr 4125   X. cxp 4767

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 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 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775

This theorem is referenced by:  brinxp  4838  fncnv  5442  erinxp  6873  isstructim  13344  isstructr  13345