Theorem brinxp2 4730

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 4085	. 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 4694	. . . 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 982	. . 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 980   e. wcel 2167   i^i cin 3156   class class class wbr 4033   X. cxp 4661

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669

This theorem is referenced by:  brinxp  4731  fncnv  5324  erinxp  6668  isstructim  12692  isstructr  12693