Theorem bj-inex 13276

Description: The intersection of two sets is a set, from bounded separation. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-inex	|- ( ( A e. V /\ B e. W ) -> ( A i^i B ) e. _V )

Proof of Theorem bj-inex

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

Step	Hyp	Ref	Expression
1		elisset 2703	. 2 |- ( A e. V -> E. x x = A )
2		elisset 2703	. 2 |- ( B e. W -> E. y y = B )
3		ax-17 1507	. . . 4 |- ( E. y y = B -> A. x E. y y = B )
4		19.29r 1601	. . . 4 |- ( ( E. x x = A /\ A. x E. y y = B ) -> E. x ( x = A /\ E. y y = B ) )
5	3, 4	sylan2 284	. . 3 |- ( ( E. x x = A /\ E. y y = B ) -> E. x ( x = A /\ E. y y = B ) )
6		ax-17 1507	. . . . 5 |- ( x = A -> A. y x = A )
7		19.29 1600	. . . . 5 |- ( ( A. y x = A /\ E. y y = B ) -> E. y ( x = A /\ y = B ) )
8	6, 7	sylan 281	. . . 4 |- ( ( x = A /\ E. y y = B ) -> E. y ( x = A /\ y = B ) )
9	8	eximi 1580	. . 3 |- ( E. x ( x = A /\ E. y y = B ) -> E. x E. y ( x = A /\ y = B ) )
10		ineq12 3277	. . . . 5 |- ( ( x = A /\ y = B ) -> ( x i^i y ) = ( A i^i B ) )
11	10	2eximi 1581	. . . 4 |- ( E. x E. y ( x = A /\ y = B ) -> E. x E. y ( x i^i y ) = ( A i^i B ) )
12		dfin5 3083	. . . . . . 7 |- ( x i^i y ) = { z e. x | z e. y }
13		vex 2692	. . . . . . . 8 |- x e. _V
14		ax-bdel 13190	. . . . . . . . 9 |- BOUNDED z e. y
15		bdcv 13217	. . . . . . . . 9 |- BOUNDED x
16	14, 15	bdrabexg 13275	. . . . . . . 8 |- ( x e. _V -> { z e. x | z e. y } e. _V )
17	13, 16	ax-mp 5	. . . . . . 7 |- { z e. x | z e. y } e. _V
18	12, 17	eqeltri 2213	. . . . . 6 |- ( x i^i y ) e. _V
19		eleq1 2203	. . . . . 6 |- ( ( x i^i y ) = ( A i^i B ) -> ( ( x i^i y ) e. _V <-> ( A i^i B ) e. _V ) )
20	18, 19	mpbii 147	. . . . 5 |- ( ( x i^i y ) = ( A i^i B ) -> ( A i^i B ) e. _V )
21	20	exlimivv 1869	. . . 4 |- ( E. x E. y ( x i^i y ) = ( A i^i B ) -> ( A i^i B ) e. _V )
22	11, 21	syl 14	. . 3 |- ( E. x E. y ( x = A /\ y = B ) -> ( A i^i B ) e. _V )
23	5, 9, 22	3syl 17	. 2 |- ( ( E. x x = A /\ E. y y = B ) -> ( A i^i B ) e. _V )
24	1, 2, 23	syl2an 287	1 |- ( ( A e. V /\ B e. W ) -> ( A i^i B ) e. _V )

Syntax hints:   -> wi 4   /\ wa 103   A.wal 1330   = wceq 1332   E.wex 1469   e. wcel 1481   {crab 2421   _Vcvv 2689   i^i cin 3075

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-bd0 13182  ax-bdan 13184  ax-bdel 13190  ax-bdsb 13191  ax-bdsep 13253

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rab 2426  df-v 2691  df-in 3082  df-ss 3089  df-bdc 13210

This theorem is referenced by:  speano5  13313