Theorem opeliunxp2 4920

Description: Membership in a union of cross products. (Contributed by Mario Carneiro, 14-Feb-2015.)

Hypothesis

Ref	Expression
opeliunxp2.1	|- ( x = C -> B = E )

Assertion

Ref	Expression
opeliunxp2	|- ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) )

Distinct variable groups:   x, C   x, D   x, E   x, A

Allowed substitution hint:   B( x)

Proof of Theorem opeliunxp2

Step	Hyp	Ref	Expression
1		df-br 4131	. . 3 |- ( C U_ x e. A ( { x } X. B ) D <-> <. C , D >. e. U_ x e. A ( { x } X. B ) )
2		relxp 4884	. . . . . 6 |- Rel ( { x } X. B )
3	2	rgenw 2605	. . . . 5 |- A. x e. A Rel ( { x } X. B )
4		reliun 4898	. . . . 5 |- ( Rel U_ x e. A ( { x } X. B ) <-> A. x e. A Rel ( { x } X. B ) )
5	3, 4	mpbir 146	. . . 4 |- Rel U_ x e. A ( { x } X. B )
6	5	brrelex1i 4818	. . 3 |- ( C U_ x e. A ( { x } X. B ) D -> C e. _V )
7	1, 6	sylbir 135	. 2 |- ( <. C , D >. e. U_ x e. A ( { x } X. B ) -> C e. _V )
8		elex 2833	. . 3 |- ( C e. A -> C e. _V )
9	8	adantr 276	. 2 |- ( ( C e. A /\ D e. E ) -> C e. _V )
10		nfcv 2392	. . 3 |- F/_ x C
11		nfiu1 4042	. . . . 5 |- F/_ x U_ x e. A ( { x } X. B )
12	11	nfel2 2405	. . . 4 |- F/ x <. C , D >. e. U_ x e. A ( { x } X. B )
13		nfv 1581	. . . 4 |- F/ x ( C e. A /\ D e. E )
14	12, 13	nfbi 1642	. . 3 |- F/ x ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) )
15		opeq1 3904	. . . . 5 |- ( x = C -> <. x , D >. = <. C , D >. )
16	15	eleq1d 2307	. . . 4 |- ( x = C -> ( <. x , D >. e. U_ x e. A ( { x } X. B ) <-> <. C , D >. e. U_ x e. A ( { x } X. B ) ) )
17		eleq1 2301	. . . . 5 |- ( x = C -> ( x e. A <-> C e. A ) )
18		opeliunxp2.1	. . . . . 6 |- ( x = C -> B = E )
19	18	eleq2d 2308	. . . . 5 |- ( x = C -> ( D e. B <-> D e. E ) )
20	17, 19	anbi12d 477	. . . 4 |- ( x = C -> ( ( x e. A /\ D e. B ) <-> ( C e. A /\ D e. E ) ) )
21	16, 20	bibi12d 235	. . 3 |- ( x = C -> ( ( <. x , D >. e. U_ x e. A ( { x } X. B ) <-> ( x e. A /\ D e. B ) ) <-> ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) ) ) )
22		opeliunxp 4830	. . 3 |- ( <. x , D >. e. U_ x e. A ( { x } X. B ) <-> ( x e. A /\ D e. B ) )
23	10, 14, 21, 22	vtoclgf 2881	. 2 |- ( C e. _V -> ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) ) )
24	7, 9, 23	pm5.21nii 716	1 |- ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   _Vcvv 2821   {csn 3709   <.cop 3712   U_ciun 4012   class class class wbr 4130   X. cxp 4772   Rel wrel 4779

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346

This proof 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-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-iun 4014  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781

This theorem is used by:  mpoxopn0yelv  6510  eldvap  15783