Theorem opeliunxp 4696

Description: Membership in a union of cross products. (Contributed by Mario Carneiro, 29-Dec-2014.) (Revised by Mario Carneiro, 1-Jan-2017.)

Assertion

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

Proof of Theorem opeliunxp

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2763	. 2 |- ( <. x , C >. e. U_ x e. A ( { x } X. B ) -> <. x , C >. e. _V )
2		opexg 4243	. 2 |- ( ( x e. A /\ C e. B ) -> <. x , C >. e. _V )
3		df-rex 2474	. . . . . 6 |- ( E. x e. A y e. ( { x } X. B ) <-> E. x ( x e. A /\ y e. ( { x } X. B ) ) )
4		nfv 1539	. . . . . . 7 |- F/ z ( x e. A /\ y e. ( { x } X. B ) )
5		nfs1v 1951	. . . . . . . 8 |- F/ x [ z / x ] x e. A
6		nfcv 2332	. . . . . . . . . 10 |- F/_ x { z }
7		nfcsb1v 3105	. . . . . . . . . 10 |- F/_ x [_ z / x ]_ B
8	6, 7	nfxp 4668	. . . . . . . . 9 |- F/_ x ( { z } X. [_ z / x ]_ B )
9	8	nfcri 2326	. . . . . . . 8 |- F/ x y e. ( { z } X. [_ z / x ]_ B )
10	5, 9	nfan 1576	. . . . . . 7 |- F/ x ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) )
11		sbequ12 1782	. . . . . . . 8 |- ( x = z -> ( x e. A <-> [ z / x ] x e. A ) )
12		sneq 3618	. . . . . . . . . 10 |- ( x = z -> { x } = { z } )
13		csbeq1a 3081	. . . . . . . . . 10 |- ( x = z -> B = [_ z / x ]_ B )
14	12, 13	xpeq12d 4666	. . . . . . . . 9 |- ( x = z -> ( { x } X. B ) = ( { z } X. [_ z / x ]_ B ) )
15	14	eleq2d 2259	. . . . . . . 8 |- ( x = z -> ( y e. ( { x } X. B ) <-> y e. ( { z } X. [_ z / x ]_ B ) ) )
16	11, 15	anbi12d 473	. . . . . . 7 |- ( x = z -> ( ( x e. A /\ y e. ( { x } X. B ) ) <-> ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) ) ) )
17	4, 10, 16	cbvex 1767	. . . . . 6 |- ( E. x ( x e. A /\ y e. ( { x } X. B ) ) <-> E. z ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) ) )
18	3, 17	bitri 184	. . . . 5 |- ( E. x e. A y e. ( { x } X. B ) <-> E. z ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) ) )
19		eleq1 2252	. . . . . . 7 |- ( y = <. x , C >. -> ( y e. ( { z } X. [_ z / x ]_ B ) <-> <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) )
20	19	anbi2d 464	. . . . . 6 |- ( y = <. x , C >. -> ( ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) ) <-> ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) ) )
21	20	exbidv 1836	. . . . 5 |- ( y = <. x , C >. -> ( E. z ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) ) <-> E. z ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) ) )
22	18, 21	bitrid 192	. . . 4 |- ( y = <. x , C >. -> ( E. x e. A y e. ( { x } X. B ) <-> E. z ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) ) )
23		df-iun 3903	. . . 4 |- U_ x e. A ( { x } X. B ) = { y | E. x e. A y e. ( { x } X. B ) }
24	22, 23	elab2g 2899	. . 3 |- ( <. x , C >. e. _V -> ( <. x , C >. e. U_ x e. A ( { x } X. B ) <-> E. z ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) ) )
25		opelxp 4671	. . . . . . 7 |- ( <. x , C >. e. ( { z } X. [_ z / x ]_ B ) <-> ( x e. { z } /\ C e. [_ z / x ]_ B ) )
26	25	anbi2i 457	. . . . . 6 |- ( ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) <-> ( [ z / x ] x e. A /\ ( x e. { z } /\ C e. [_ z / x ]_ B ) ) )
27		an12 561	. . . . . 6 |- ( ( [ z / x ] x e. A /\ ( x e. { z } /\ C e. [_ z / x ]_ B ) ) <-> ( x e. { z } /\ ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) ) )
28		velsn 3624	. . . . . . . 8 |- ( x e. { z } <-> x = z )
29		equcom 1717	. . . . . . . 8 |- ( x = z <-> z = x )
30	28, 29	bitri 184	. . . . . . 7 |- ( x e. { z } <-> z = x )
31	30	anbi1i 458	. . . . . 6 |- ( ( x e. { z } /\ ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) ) <-> ( z = x /\ ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) ) )
32	26, 27, 31	3bitri 206	. . . . 5 |- ( ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) <-> ( z = x /\ ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) ) )
33	32	exbii 1616	. . . 4 |- ( E. z ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) <-> E. z ( z = x /\ ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) ) )
34		vex 2755	. . . . 5 |- x e. _V
35		sbequ12r 1783	. . . . . 6 |- ( z = x -> ( [ z / x ] x e. A <-> x e. A ) )
36	13	equcoms 1719	. . . . . . . 8 |- ( z = x -> B = [_ z / x ]_ B )
37	36	eqcomd 2195	. . . . . . 7 |- ( z = x -> [_ z / x ]_ B = B )
38	37	eleq2d 2259	. . . . . 6 |- ( z = x -> ( C e. [_ z / x ]_ B <-> C e. B ) )
39	35, 38	anbi12d 473	. . . . 5 |- ( z = x -> ( ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) <-> ( x e. A /\ C e. B ) ) )
40	34, 39	ceqsexv 2791	. . . 4 |- ( E. z ( z = x /\ ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) ) <-> ( x e. A /\ C e. B ) )
41	33, 40	bitri 184	. . 3 |- ( E. z ( [ z / x ] x e. A /\ <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) <-> ( x e. A /\ C e. B ) )
42	24, 41	bitrdi 196	. 2 |- ( <. x , C >. e. _V -> ( <. x , C >. e. U_ x e. A ( { x } X. B ) <-> ( x e. A /\ C e. B ) ) )
43	1, 2, 42	pm5.21nii 705	1 |- ( <. x , C >. e. U_ x e. A ( { x } X. B ) <-> ( x e. A /\ C e. B ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1364   E.wex 1503   [wsb 1773   e. wcel 2160   E.wrex 2469   _Vcvv 2752   [_csb 3072   {csn 3607   <.cop 3610   U_ciun 3901   X. cxp 4639

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4189  ax-pr 4224

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-sbc 2978  df-csb 3073  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-iun 3903  df-opab 4080  df-xp 4647

This theorem is referenced by:  eliunxp  4781  opeliunxp2  4782  opeliunxp2f  6257