Theorem opeliunxp 4825

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 2833	. 2 |- ( <. x , C >. e. U_ x e. A ( { x } X. B ) -> <. x , C >. e. _V )
2		opexg 4363	. 2 |- ( ( x e. A /\ C e. B ) -> <. x , C >. e. _V )
3		df-rex 2534	. . . . . 6 |- ( E. x e. A y e. ( { x } X. B ) <-> E. x ( x e. A /\ y e. ( { x } X. B ) ) )
4		nfv 1581	. . . . . . 7 |- F/ z ( x e. A /\ y e. ( { x } X. B ) )
5		nfs1v 1999	. . . . . . . 8 |- F/ x [ z / x ] x e. A
6		nfcv 2392	. . . . . . . . . 10 |- F/_ x { z }
7		nfcsb1v 3180	. . . . . . . . . 10 |- F/_ x [_ z / x ]_ B
8	6, 7	nfxp 4796	. . . . . . . . 9 |- F/_ x ( { z } X. [_ z / x ]_ B )
9	8	nfcri 2386	. . . . . . . 8 |- F/ x y e. ( { z } X. [_ z / x ]_ B )
10	5, 9	nfan 1618	. . . . . . 7 |- F/ x ( [ z / x ] x e. A /\ y e. ( { z } X. [_ z / x ]_ B ) )
11		sbequ12 1824	. . . . . . . 8 |- ( x = z -> ( x e. A <-> [ z / x ] x e. A ) )
12		sneq 3716	. . . . . . . . . 10 |- ( x = z -> { x } = { z } )
13		csbeq1a 3156	. . . . . . . . . 10 |- ( x = z -> B = [_ z / x ]_ B )
14	12, 13	xpeq12d 4794	. . . . . . . . 9 |- ( x = z -> ( { x } X. B ) = ( { z } X. [_ z / x ]_ B ) )
15	14	eleq2d 2308	. . . . . . . 8 |- ( x = z -> ( y e. ( { x } X. B ) <-> y e. ( { z } X. [_ z / x ]_ B ) ) )
16	11, 15	anbi12d 477	. . . . . . 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 1809	. . . . . 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 2301	. . . . . . 7 |- ( y = <. x , C >. -> ( y e. ( { z } X. [_ z / x ]_ B ) <-> <. x , C >. e. ( { z } X. [_ z / x ]_ B ) ) )
20	19	anbi2d 468	. . . . . 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 1878	. . . . 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 4009	. . . 4 |- U_ x e. A ( { x } X. B ) = { y | E. x e. A y e. ( { x } X. B ) }
24	22, 23	elab2g 2973	. . 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 4799	. . . . . . 7 |- ( <. x , C >. e. ( { z } X. [_ z / x ]_ B ) <-> ( x e. { z } /\ C e. [_ z / x ]_ B ) )
26	25	anbi2i 461	. . . . . 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 567	. . . . . 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 3722	. . . . . . . 8 |- ( x e. { z } <-> x = z )
29		equcom 1758	. . . . . . . 8 |- ( x = z <-> z = x )
30	28, 29	bitri 184	. . . . . . 7 |- ( x e. { z } <-> z = x )
31	30	anbi1i 462	. . . . . 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 1658	. . . 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 2824	. . . . 5 |- x e. _V
35		sbequ12r 1825	. . . . . 6 |- ( z = x -> ( [ z / x ] x e. A <-> x e. A ) )
36	13	equcoms 1760	. . . . . . . 8 |- ( z = x -> B = [_ z / x ]_ B )
37	36	eqcomd 2244	. . . . . . 7 |- ( z = x -> [_ z / x ]_ B = B )
38	37	eleq2d 2308	. . . . . 6 |- ( z = x -> ( C e. [_ z / x ]_ B <-> C e. B ) )
39	35, 38	anbi12d 477	. . . . 5 |- ( z = x -> ( ( [ z / x ] x e. A /\ C e. [_ z / x ]_ B ) <-> ( x e. A /\ C e. B ) ) )
40	34, 39	ceqsexv 2861	. . . 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 716	1 |- ( <. x , C >. e. U_ x e. A ( { x } X. B ) <-> ( x e. A /\ C e. B ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1402   E.wex 1545   [wsb 1815   e. wcel 2209   E.wrex 2529   _Vcvv 2821   [_csb 3147   {csn 3705   <.cop 3708   U_ciun 4007   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-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-iun 4009  df-opab 4188  df-xp 4775

This theorem is referenced by:  eliunxp  4914  opeliunxp2  4915  opeliunxp2f  6499