Theorem opeliunxp2f 6347

Description: Membership in a union of Cartesian products, using bound-variable hypothesis for E instead of distinct variable conditions as in opeliunxp2 4836. (Contributed by AV, 25-Oct-2020.)

Hypotheses

Ref	Expression
opeliunxp2f.f	|- F/_ x E
opeliunxp2f.e	|- ( x = C -> B = E )

Assertion

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

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

Allowed substitution hints:   B( x)   E( x)

Proof of Theorem opeliunxp2f

Step	Hyp	Ref	Expression
1		df-br 4060	. . 3 |- ( C U_ x e. A ( { x } X. B ) D <-> <. C , D >. e. U_ x e. A ( { x } X. B ) )
2		relxp 4802	. . . . . 6 |- Rel ( { x } X. B )
3	2	rgenw 2563	. . . . 5 |- A. x e. A Rel ( { x } X. B )
4		reliun 4814	. . . . 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 4736	. . 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 2788	. . 3 |- ( C e. A -> C e. _V )
9	8	adantr 276	. 2 |- ( ( C e. A /\ D e. E ) -> C e. _V )
10		nfiu1 3971	. . . . 5 |- F/_ x U_ x e. A ( { x } X. B )
11	10	nfel2 2363	. . . 4 |- F/ x <. C , D >. e. U_ x e. A ( { x } X. B )
12		nfv 1552	. . . . 5 |- F/ x C e. A
13		opeliunxp2f.f	. . . . . 6 |- F/_ x E
14	13	nfel2 2363	. . . . 5 |- F/ x D e. E
15	12, 14	nfan 1589	. . . 4 |- F/ x ( C e. A /\ D e. E )
16	11, 15	nfbi 1613	. . 3 |- F/ x ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) )
17		opeq1 3833	. . . . 5 |- ( x = C -> <. x , D >. = <. C , D >. )
18	17	eleq1d 2276	. . . 4 |- ( x = C -> ( <. x , D >. e. U_ x e. A ( { x } X. B ) <-> <. C , D >. e. U_ x e. A ( { x } X. B ) ) )
19		eleq1 2270	. . . . 5 |- ( x = C -> ( x e. A <-> C e. A ) )
20		opeliunxp2f.e	. . . . . 6 |- ( x = C -> B = E )
21	20	eleq2d 2277	. . . . 5 |- ( x = C -> ( D e. B <-> D e. E ) )
22	19, 21	anbi12d 473	. . . 4 |- ( x = C -> ( ( x e. A /\ D e. B ) <-> ( C e. A /\ D e. E ) ) )
23	18, 22	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 ) ) ) )
24		opeliunxp 4748	. . 3 |- ( <. x , D >. e. U_ x e. A ( { x } X. B ) <-> ( x e. A /\ D e. B ) )
25	16, 23, 24	vtoclg1f 2837	. 2 |- ( C e. _V -> ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) ) )
26	7, 9, 25	pm5.21nii 706	1 |- ( <. C , D >. e. U_ x e. A ( { x } X. B ) <-> ( C e. A /\ D e. E ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1373   e. wcel 2178   F/_wnfc 2337   A.wral 2486   _Vcvv 2776   {csn 3643   <.cop 3646   U_ciun 3941   class class class wbr 4059   X. cxp 4691   Rel wrel 4698

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-iun 3943  df-br 4060  df-opab 4122  df-xp 4699  df-rel 4700

This theorem is referenced by:  fisumcom2  11864  fprodcom2fi  12052